Triple
T12797442
| Position | Surface form | Disambiguated ID | Type / Status |
|---|---|---|---|
| Subject | Introduction to Automata Theory, Languages, and Computation |
E305925
|
entity |
| Predicate | topic |
P261
|
FINISHED |
| Object | Chomsky hierarchy |
E644
|
NE FINISHED |
How this triple was built (2 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: Chomsky hierarchy | Statement: [Introduction to Automata Theory, Languages, and Computation, topic, Chomsky hierarchy]
NED1
Entity disambiguation (via context triple)
gpt-5-mini-2025-08-07
Target entity: Chomsky hierarchy Context triple: [Introduction to Automata Theory, Languages, and Computation, topic, Chomsky hierarchy]
-
A.
Chomsky hierarchy
chosen
The Chomsky hierarchy is a classification of formal grammars into four types that correspond to increasing levels of generative power and computational complexity in formal language theory.
-
B.
Moore language
Moore language is a major Gur language of Burkina Faso, spoken primarily by the Mossi people and serving as one of the country’s most widely used lingua francas.
-
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.
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.
-
E.
Formal Language Theory
Formal Language Theory is a branch of computer science and mathematics that studies abstract languages and the automata or grammars that define and recognize them.
- F. None of above.
- G. Unsure - the case is ambiguous/there is not enough information to decide.
Provenance (3 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_69d7bdf366888190a8cccb982606889c |
completed | April 9, 2026, 2:55 p.m. |
| NER | Named-entity recognition | batch_69d96e6db68481909a2ca8da1287f3e0 |
completed | April 10, 2026, 9:41 p.m. |
| NED1 | Entity disambiguation (via context triple) | batch_69f6850d6ebc8190aaffcac09f4b15eb |
completed | May 2, 2026, 11:13 p.m. |
Created at: April 9, 2026, 5:30 p.m.