Triple
T14984174
| Position | Surface form | Disambiguated ID | Type / Status |
|---|---|---|---|
| Subject | Cooley–Tukey Fast Fourier Transform algorithm |
E373658
|
entity |
| Predicate | hasVariant |
P455
|
FINISHED |
| Object |
mixed-radix Cooley–Tukey FFT
The mixed-radix Cooley–Tukey FFT is a variant of the Fast Fourier Transform algorithm that efficiently computes discrete Fourier transforms by factoring the transform size into a product of smaller, not-necessarily-equal radices.
|
E373658
|
NE FINISHED |
How this triple was built (4 steps)
Every LLM step that produced this triple, in pipeline order — named-entity classification, the disambiguation choices (the exact options shown, with the pick highlighted), and the generated description. The batch + timestamp of each is in the Provenance table below.
NER
Named-entity recognition
gpt-5-mini
Instruction
Given a phrase, classify it is english named entity (e.g., persons, organizations, works of art) in Latin script, or not (e.g., literals, dates, URLs, verbose phrases). For disambiguation, the statement where the phrase occurs as object is also given. Please return a JSON object with `phrase` (string, the phrase being analyzed) and `is_ne` (boolean, indicating whether the phrase is a Named Entity).
Input
Phrase: mixed-radix Cooley–Tukey FFT | Statement: [Cooley–Tukey Fast Fourier Transform algorithm, hasVariant, mixed-radix Cooley–Tukey FFT]
NED1
Entity disambiguation (via context triple)
gpt-5-mini-2025-08-07
Target entity: mixed-radix Cooley–Tukey FFT Context triple: [Cooley–Tukey Fast Fourier Transform algorithm, hasVariant, mixed-radix Cooley–Tukey FFT]
-
A.
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.
-
B.
FFT
FFT is the ICAO airline designator used in aviation to identify Frontier Airlines in flight plans and air traffic control communications.
-
C.
FFT
FFT is the French Tennis Federation, the national governing body for tennis in France and organizer of major tournaments including the French Open.
-
D.
FFT
FFT is the IATA airport code for Capital City Airport in Kentucky, United States.
-
E.
2 CFFTS
2 CFFTS is a Royal Canadian Air Force training unit responsible for providing pilot and aircrew flying instruction in Canada.
- F. None of above. chosen
- G. Unsure - the case is ambiguous/there is not enough information to decide.
NEDg
Description generation
gpt-5.1
Instruction
Generate a one-sentence description of the target entity. You are given a context triple in the form (subject, predicate, object), where the object is the target entity. # Instructions Use the triple to infer relevant information about the entity. Describe the entity based on what is most defining, well-known. Avoid repeating the information from the triple, unless really essential. # Response Format Return only the sentence: "Description: [one-sentence description of the target entity]"
Input
Entity: mixed-radix Cooley–Tukey FFT Triple: [Cooley–Tukey Fast Fourier Transform algorithm, hasVariant, mixed-radix Cooley–Tukey FFT]
Generated description
The mixed-radix Cooley–Tukey FFT is a variant of the Fast Fourier Transform algorithm that efficiently computes discrete Fourier transforms by factoring the transform size into a product of smaller, not-necessarily-equal radices.
NED2
Entity disambiguation (via description)
gpt-5-mini-2025-08-07
Target entity: mixed-radix Cooley–Tukey FFT Target entity description: The mixed-radix Cooley–Tukey FFT is a variant of the Fast Fourier Transform algorithm that efficiently computes discrete Fourier transforms by factoring the transform size into a product of smaller, not-necessarily-equal radices.
-
A.
Cooley–Tukey Fast Fourier Transform algorithm
chosen
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.
-
B.
FFT
FFT is the ICAO airline designator used in aviation to identify Frontier Airlines in flight plans and air traffic control communications.
-
C.
FFT
FFT is the IATA airport code for Capital City Airport in Kentucky, United States.
-
D.
FFT
FFT is the French Tennis Federation, the national governing body for tennis in France and organizer of major tournaments including the French Open.
-
E.
2 CFFTS
2 CFFTS is a Royal Canadian Air Force training unit responsible for providing pilot and aircrew flying instruction in Canada.
- F. None of above.
Provenance (5 batches)
The batch behind each pipeline step, in order, with when it ran. Timestamps are batch-level — stages were processed in waves, so the object chain (NER → NED1 → NEDg → NED2) reads in order, but predicate / elicitation batches can sit in a different wave.
| Step | Stage | Batch ID | Status | When |
|---|---|---|---|---|
| creating | Elicitation | batch_69d85ccc84388190aa151e5173370c8d |
completed | April 10, 2026, 2:13 a.m. |
| NER | Named-entity recognition | batch_69ded6ff4a7c8190ab7554f3a1a09b67 |
completed | April 15, 2026, 12:08 a.m. |
| NED1 | Entity disambiguation (via context triple) | batch_69fe9694aa688190bbecb645c49e795e |
completed | May 9, 2026, 2:06 a.m. |
| NEDg | Description generation | batch_69fe99553b3c8190b6bf3e133a2772fa |
completed | May 9, 2026, 2:17 a.m. |
| NED2 | Entity disambiguation (via description) | batch_69fe99a856e48190a44548d756737164 |
completed | May 9, 2026, 2:19 a.m. |
Created at: April 10, 2026, 2:52 a.m.