Triple
T6850555
| Position | Surface form | Disambiguated ID | Type / Status |
|---|---|---|---|
| Subject | French Open |
E158003
|
entity |
| Predicate | governingBody |
P46
|
FINISHED |
| Object |
FFT
FFT is the French Tennis Federation, the national governing body for tennis in France and organizer of major tournaments including the French Open.
|
E623630
|
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: FFT | Statement: [French Open, governingBody, FFT]
NED1
Entity disambiguation (via context triple)
gpt-5-mini-2025-08-07
Target entity: FFT Context triple: [French Open, governingBody, FFT]
-
A.
FFT
FFT is the ICAO airline designator used in aviation to identify Frontier Airlines in flight plans and air traffic control communications.
-
B.
Fourier transform
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.
-
C.
Fourier
Fourier is a French surname most famously associated with Jean-Baptiste Joseph Fourier, the mathematician and physicist known for developing Fourier analysis and Fourier series.
-
D.
2 CFFTS
2 CFFTS is a Royal Canadian Air Force training unit responsible for providing pilot and aircrew flying instruction in Canada.
-
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. 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: FFT Triple: [French Open, governingBody, FFT]
Generated description
FFT is the French Tennis Federation, the national governing body for tennis in France and organizer of major tournaments including the French Open.
NED2
Entity disambiguation (via description)
gpt-5-mini-2025-08-07
Target entity: FFT Target entity description: FFT is the French Tennis Federation, the national governing body for tennis in France and organizer of major tournaments including the French Open.
-
A.
FFT
FFT is the ICAO airline designator used in aviation to identify Frontier Airlines in flight plans and air traffic control communications.
-
B.
Fourier transform
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.
-
C.
Fourier
Fourier is a French surname most famously associated with Jean-Baptiste Joseph Fourier, the mathematician and physicist known for developing Fourier analysis and Fourier series.
-
D.
2 CFFTS
2 CFFTS is a Royal Canadian Air Force training unit responsible for providing pilot and aircrew flying instruction in Canada.
-
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. chosen
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_69c6882fae988190864cbba788c5ebb4 |
completed | March 27, 2026, 1:37 p.m. |
| NER | Named-entity recognition | batch_69c6d84c45708190918adfc028252400 |
completed | March 27, 2026, 7:19 p.m. |
| NED1 | Entity disambiguation (via context triple) | batch_69c72fd2800c8190997c0bc7ff3e1491 |
completed | March 28, 2026, 1:33 a.m. |
| NEDg | Description generation | batch_69c73208e9408190b246837c0e436575 |
completed | March 28, 2026, 1:42 a.m. |
| NED2 | Entity disambiguation (via description) | batch_69c7326b04ac8190a700061e6546cb50 |
completed | March 28, 2026, 1:44 a.m. |
Created at: March 27, 2026, 2:20 p.m.