Triple
T13601948
| Position | Surface form | Disambiguated ID | Type / Status |
|---|---|---|---|
| Subject | MDCT |
E324964
|
entity |
| Predicate | basedOn |
P98
|
FINISHED |
| Object | Discrete Cosine Transform |
E577496
|
NE FINISHED |
How this triple was built (2 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: Discrete Cosine Transform | Statement: [MDCT, basedOn, Discrete Cosine Transform]
NED1
Entity disambiguation (via context triple)
gpt-5-mini-2025-08-07
Target entity: Discrete Cosine Transform Context triple: [MDCT, basedOn, Discrete Cosine Transform]
-
A.
FFT
FFT is the French Tennis Federation, the national governing body for tennis in France and organizer of major tournaments including the French Open.
-
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.
Fourier transform
chosen
The Fourier transform is a mathematical operation that decomposes a function or signal into its constituent frequencies, widely used in engineering, physics, and signal processing.
-
E.
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.
- F. None of above.
- G. Unsure - the case is ambiguous/there is not enough information to decide.
Provenance (3 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_69d80769eaf081909d82f44e484d6113 |
completed | April 9, 2026, 8:09 p.m. |
| NER | Named-entity recognition | batch_69dbb07ad3f48190a2173e42c5cfedb1 |
completed | April 12, 2026, 2:47 p.m. |
| NED1 | Entity disambiguation (via context triple) | batch_69f77f92224c8190b66adef1291cd47f |
completed | May 3, 2026, 5:02 p.m. |
Created at: April 9, 2026, 9:49 p.m.