Triple
T11958215
| Position | Surface form | Disambiguated ID | Type / Status |
|---|---|---|---|
| Subject | GNU Bison |
E284604
|
entity |
| Predicate | compatibleWith |
P203
|
FINISHED |
| Object |
POSIX Yacc
POSIX Yacc is the standardized version of the classic Unix parser generator specification that many tools, such as GNU Bison, emulate for compatibility in building parsers from context-free grammars.
|
E956190
|
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: POSIX Yacc | Statement: [GNU Bison, compatibleWith, POSIX Yacc]
NED1
Entity disambiguation (via context triple)
gpt-5-mini-2025-08-07
Target entity: POSIX Yacc Context triple: [GNU Bison, compatibleWith, POSIX Yacc]
-
A.
GNU Bison
GNU Bison is a widely used parser generator that converts context-free grammars into C-based parsers, commonly employed in compilers and interpreters within the GNU ecosystem.
-
B.
GNU Flex
GNU Flex is a widely used open-source lexical analyzer generator that produces C-based scanners for tokenizing text according to user-defined patterns.
-
C.
javacc
JavaCC is a popular open-source parser generator for Java that allows developers to define grammars and automatically produce parsers.
-
D.
PL/M programming language
PL/M is a high-level systems programming language created in the early 1970s for Intel microprocessors, widely used for low-level and embedded software development.
-
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: POSIX Yacc Triple: [GNU Bison, compatibleWith, POSIX Yacc]
Generated description
POSIX Yacc is the standardized version of the classic Unix parser generator specification that many tools, such as GNU Bison, emulate for compatibility in building parsers from context-free grammars.
NED2
Entity disambiguation (via description)
gpt-5-mini-2025-08-07
Target entity: POSIX Yacc Target entity description: POSIX Yacc is the standardized version of the classic Unix parser generator specification that many tools, such as GNU Bison, emulate for compatibility in building parsers from context-free grammars.
-
A.
GNU Bison
GNU Bison is a widely used parser generator that converts context-free grammars into C-based parsers, commonly employed in compilers and interpreters within the GNU ecosystem.
-
B.
GNU Flex
GNU Flex is a widely used open-source lexical analyzer generator that produces C-based scanners for tokenizing text according to user-defined patterns.
-
C.
javacc
JavaCC is a popular open-source parser generator for Java that allows developers to define grammars and automatically produce parsers.
-
D.
PL/M programming language
PL/M is a high-level systems programming language created in the early 1970s for Intel microprocessors, widely used for low-level and embedded software development.
-
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_69d6ab2db38c8190b1f0ed6663ef8ada |
completed | April 8, 2026, 7:23 p.m. |
| NER | Named-entity recognition | batch_69d903681a00819098c2b5260e2ef834 |
completed | April 10, 2026, 2:04 p.m. |
| NED1 | Entity disambiguation (via context triple) | batch_69f459210d1c8190953cd01da3d2ad04 |
completed | May 1, 2026, 7:41 a.m. |
| NEDg | Description generation | batch_69f4645ef63881909b46937f73d637a3 |
completed | May 1, 2026, 8:29 a.m. |
| NED2 | Entity disambiguation (via description) | batch_69f465be4db08190882898a17d077019 |
completed | May 1, 2026, 8:35 a.m. |
Created at: April 8, 2026, 9:45 p.m.