Triple
T11016864
| Position | Surface form | Disambiguated ID | Type / Status |
|---|---|---|---|
| Subject | Tom Duff |
E260386
|
entity |
| Predicate | knownFor |
P22
|
FINISHED |
| Object |
Duff's device
Duff's device is a loop-unrolling technique in the C programming language that exploits switch-case fall-through to optimize data copying, famously demonstrating an unusual and clever use of C's control structures.
|
E900227
|
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: Duff's device | Statement: [Tom Duff, knownFor, Duff's device]
NED1
Entity disambiguation (via context triple)
gpt-5-mini-2025-08-07
Target entity: Duff's device Context triple: [Tom Duff, knownFor, Duff's device]
-
A.
Marzullo's algorithm
Marzullo's algorithm is a method for selecting the most likely correct time interval from multiple, possibly conflicting time sources, commonly used in clock synchronization systems.
-
B.
M4 macro processor
The M4 macro processor is a general-purpose macro processing language and tool commonly used in Unix-like systems for generating and transforming text, especially in build and configuration workflows.
-
C.
SIMD within a register (SWAR)
SIMD within a register (SWAR) is a technique that exploits standard CPU registers and instructions to perform parallel operations on multiple smaller data elements packed into a single register, enabling data-level parallelism without dedicated vector hardware.
-
D.
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.
-
E.
Eiffel programming language
Eiffel is an object-oriented programming language designed by Bertrand Meyer that emphasizes software correctness through features like Design by Contract and strong support for modular, reusable code.
- 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: Duff's device Triple: [Tom Duff, knownFor, Duff's device]
Generated description
Duff's device is a loop-unrolling technique in the C programming language that exploits switch-case fall-through to optimize data copying, famously demonstrating an unusual and clever use of C's control structures.
NED2
Entity disambiguation (via description)
gpt-5-mini-2025-08-07
Target entity: Duff's device Target entity description: Duff's device is a loop-unrolling technique in the C programming language that exploits switch-case fall-through to optimize data copying, famously demonstrating an unusual and clever use of C's control structures.
-
A.
Marzullo's algorithm
Marzullo's algorithm is a method for selecting the most likely correct time interval from multiple, possibly conflicting time sources, commonly used in clock synchronization systems.
-
B.
M4 macro processor
The M4 macro processor is a general-purpose macro processing language and tool commonly used in Unix-like systems for generating and transforming text, especially in build and configuration workflows.
-
C.
SIMD within a register (SWAR)
SIMD within a register (SWAR) is a technique that exploits standard CPU registers and instructions to perform parallel operations on multiple smaller data elements packed into a single register, enabling data-level parallelism without dedicated vector hardware.
-
D.
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.
-
E.
Eiffel programming language
Eiffel is an object-oriented programming language designed by Bertrand Meyer that emphasizes software correctness through features like Design by Contract and strong support for modular, reusable code.
- 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_69d6aa9687448190b28d353b1b6a610e |
completed | April 8, 2026, 7:20 p.m. |
| NER | Named-entity recognition | batch_69d797a682908190b061d1995e2866b6 |
completed | April 9, 2026, 12:12 p.m. |
| NED1 | Entity disambiguation (via context triple) | batch_69e374d371ec8190aba9e77346c6e876 |
completed | April 18, 2026, 12:10 p.m. |
| NEDg | Description generation | batch_69e37ab6ca788190ac41f9494ad9a47f |
completed | April 18, 2026, 12:36 p.m. |
| NED2 | Entity disambiguation (via description) | batch_69e37c9439fc8190a69cfb1a13da4c19 |
completed | April 18, 2026, 12:44 p.m. |
Created at: April 8, 2026, 9:25 p.m.