Triple

T7540013

Position	Surface form	Disambiguated ID	Type / Status
Subject	Alfred V. Aho	`E178249`	entity
Predicate	notableConcept	`P201`	FINISHED
Object	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.	`E672059`	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: Aho–Ullman algorithms for parsing | Statement: [Alfred V. Aho, notableConcept, Aho–Ullman algorithms for parsing]

NED1 Entity disambiguation (via context triple) gpt-5-mini-2025-08-07

Target entity: Aho–Ullman algorithms for parsing
Context triple: [Alfred V. Aho, notableConcept, Aho–Ullman algorithms for parsing]

A. Thompson's algorithm for regular expression matching
Thompson's algorithm for regular expression matching is a classic method that converts regular expressions into nondeterministic finite automata (NFAs) to enable efficient pattern matching in text processing.
B. 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.
C. 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.
D. Compilers: Principles, Techniques, and Tools
Compilers: Principles, Techniques, and Tools is a foundational computer science textbook that systematically covers the theory and practice of compiler design and implementation.
E. Thompson's algorithm
Thompson's algorithm is a classic computer science method for converting regular expressions into nondeterministic finite automata (NFAs), widely used in pattern matching and lexical 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: Aho–Ullman algorithms for parsing
Triple: [Alfred V. Aho, notableConcept, Aho–Ullman algorithms for parsing]

Generated description

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.

NED2 Entity disambiguation (via description) gpt-5-mini-2025-08-07

Target entity: Aho–Ullman algorithms for parsing
Target entity description: 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.

A. Thompson's algorithm for regular expression matching
Thompson's algorithm for regular expression matching is a classic method that converts regular expressions into nondeterministic finite automata (NFAs) to enable efficient pattern matching in text processing.
B. 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.
C. 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.
D. Compilers: Principles, Techniques, and Tools
Compilers: Principles, Techniques, and Tools is a foundational computer science textbook that systematically covers the theory and practice of compiler design and implementation.
E. Thompson's algorithm
Thompson's algorithm is a classic computer science method for converting regular expressions into nondeterministic finite automata (NFAs), widely used in pattern matching and lexical 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_69c69f2be3888190a6667a27f8f195e9`	completed	March 27, 2026, 3:15 p.m.
NER	Named-entity recognition	`batch_69c6f873b17081908bb70aea0010d072`	completed	March 27, 2026, 9:36 p.m.
NED1	Entity disambiguation (via context triple)	`batch_69c84f18e4dc81909ecd73b2b06b8d9c`	completed	March 28, 2026, 9:58 p.m.
NEDg	Description generation	`batch_69c853bc094c8190ba4e7ecb069c2c02`	completed	March 28, 2026, 10:18 p.m.
NED2	Entity disambiguation (via description)	`batch_69c85412e6308190893a500e2395bd94`	completed	March 28, 2026, 10:20 p.m.

Created at: March 27, 2026, 3:48 p.m.