Triple
T3600027
| Position | Surface form | Disambiguated ID | Type / Status |
|---|---|---|---|
| Subject | John W. Tukey |
E76231
|
entity |
| Predicate | coDeveloped |
P6901
|
FINISHED |
| Object |
Cooley–Tukey Fast Fourier Transform algorithm
The Cooley–Tukey Fast Fourier Transform algorithm is a widely used, efficient method for computing the discrete Fourier transform that revolutionized digital signal processing and numerical analysis.
|
E373658
|
NE FINISHED |
Provenance (5 batches)
| Stage | Batch ID | Job type | Status |
|---|---|---|---|
| creating | batch_69ad85d93dcc819094fba90cf70f4996 |
elicitation | completed |
| NER | batch_69adc19fd57481908ce5c9daf168e213 |
ner | completed |
| NED1 | batch_69b43309a9b48190bc2aa6f970d45612 |
ned_source_triple | completed |
| NED2 | batch_69b4379cd04c81909246747bcc357261 |
ned_description | completed |
| NEDg | batch_69b43705642881909c62b7363a4f3a12 |
nedg | completed |
Created at: March 8, 2026, 3:22 p.m.