Triple
T18266047
| Position | Surface form | Disambiguated ID | Type / Status |
|---|---|---|---|
| Subject | Vaughan Pratt |
E437485
|
entity |
| Predicate | notableWork |
P4
|
FINISHED |
| Object |
Pratt parsing technique
Pratt parsing technique is a top-down operator precedence parsing method for efficiently analyzing expressions in programming language compilers and interpreters.
|
E1315959
|
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: Pratt parsing technique | Statement: [Vaughan Pratt, notableWork, Pratt parsing technique]
NED1
Entity disambiguation (via context triple)
gpt-5-mini-2025-08-07
Target entity: Pratt parsing technique Context triple: [Vaughan Pratt, notableWork, Pratt parsing technique]
-
A.
Aho–Ullman algorithms for parsing
Aho–Ullman algorithms for parsing are foundational compiler-construction techniques that efficiently analyze and translate the syntactic structure of programming languages based on formal grammar theory.
-
B.
Parspace
Parspace is a track from Stereolab’s influential 1997 album "Dots and Loops," known for its blend of experimental pop, lounge, and electronic influences.
-
C.
Van Wijngaarden grammars
Van Wijngaarden grammars are a highly expressive formal grammar formalism, introduced for defining complex programming language syntax and semantics, notably used in the specification of ALGOL 68.
-
D.
Augmented Backus–Naur Form
Augmented Backus–Naur Form (ABNF) is a standardized, extended version of Backus–Naur Form used to formally specify the syntax of languages and protocols, notably in Internet and communication standards.
-
E.
Backus–Naur Form
Backus–Naur Form is a formal notation used to define the syntax of programming languages and other formal grammars in a precise, structured way.
- 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: Pratt parsing technique Triple: [Vaughan Pratt, notableWork, Pratt parsing technique]
Generated description
Pratt parsing technique is a top-down operator precedence parsing method for efficiently analyzing expressions in programming language compilers and interpreters.
NED2
Entity disambiguation (via description)
gpt-5-mini-2025-08-07
Target entity: Pratt parsing technique Target entity description: Pratt parsing technique is a top-down operator precedence parsing method for efficiently analyzing expressions in programming language compilers and interpreters.
-
A.
Aho–Ullman algorithms for parsing
Aho–Ullman algorithms for parsing are foundational compiler-construction techniques that efficiently analyze and translate the syntactic structure of programming languages based on formal grammar theory.
-
B.
Parspace
Parspace is a track from Stereolab’s influential 1997 album "Dots and Loops," known for its blend of experimental pop, lounge, and electronic influences.
-
C.
Van Wijngaarden grammars
Van Wijngaarden grammars are a highly expressive formal grammar formalism, introduced for defining complex programming language syntax and semantics, notably used in the specification of ALGOL 68.
-
D.
Augmented Backus–Naur Form
Augmented Backus–Naur Form (ABNF) is a standardized, extended version of Backus–Naur Form used to formally specify the syntax of languages and protocols, notably in Internet and communication standards.
-
E.
Backus–Naur Form
Backus–Naur Form is a formal notation used to define the syntax of programming languages and other formal grammars in a precise, structured way.
- 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_69d8b913351c8190932b6a426de04b41 |
completed | April 10, 2026, 8:47 a.m. |
| NER | Named-entity recognition | batch_69e4ff7af85c81909859e7247738a535 |
completed | April 19, 2026, 4:14 p.m. |
| NED1 | Entity disambiguation (via context triple) | batch_6a03b3f6c1b081908fdd0ccb6f1bf633 |
completed | May 12, 2026, 11:12 p.m. |
| NEDg | Description generation | batch_6a03b4f0cd188190a9577a3999a5b473 |
completed | May 12, 2026, 11:17 p.m. |
| NED2 | Entity disambiguation (via description) | batch_6a03b5c09f4881909fb0ead5fc48895c |
completed | May 12, 2026, 11:20 p.m. |
Created at: April 10, 2026, 10:34 a.m.