Triple
T9838468
| Position | Surface form | Disambiguated ID | Type / Status |
|---|---|---|---|
| Subject | Dexter Kozen |
E239160
|
entity |
| Predicate | notableWork |
P4
|
FINISHED |
| Object |
Automata and Computability (textbook)
Automata and Computability is a widely used theoretical computer science textbook by Dexter Kozen that introduces formal languages, automata theory, and the foundations of computability.
|
E825608
|
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: Automata and Computability (textbook) | Statement: [Dexter Kozen, notableWork, Automata and Computability (textbook)]
NED1
Entity disambiguation (via context triple)
gpt-5-mini-2025-08-07
Target entity: Automata and Computability (textbook) Context triple: [Dexter Kozen, notableWork, Automata and Computability (textbook)]
-
A.
"Introduction to Automata Theory, Languages, and Computation"
"Introduction to Automata Theory, Languages, and Computation" is a foundational textbook in theoretical computer science that systematically develops the theory of automata, formal languages, and computational complexity.
-
B.
Introduction to the Theory of Computation
Introduction to the Theory of Computation is a widely used textbook in theoretical computer science that covers formal languages, automata, computability, and complexity theory.
-
C.
Elements of the Theory of Computation
Elements of the Theory of Computation is a foundational textbook that introduces the mathematical and theoretical principles underlying computer science, including automata, formal languages, and computability.
-
D.
Finite Automata and Their Decision Problems
"Finite Automata and Their Decision Problems" is a landmark 1959 paper by Dana Scott and Michael Rabin that founded the modern theory of finite automata and formalized key decision problems in automata theory and computation.
-
E.
Automata Theory
Automata Theory is a branch of theoretical computer science that studies abstract computational models and the problems they can solve, forming a foundation for formal languages, compilers, and complexity theory.
- 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: Automata and Computability (textbook) Triple: [Dexter Kozen, notableWork, Automata and Computability (textbook)]
Generated description
Automata and Computability is a widely used theoretical computer science textbook by Dexter Kozen that introduces formal languages, automata theory, and the foundations of computability.
NED2
Entity disambiguation (via description)
gpt-5-mini-2025-08-07
Target entity: Automata and Computability (textbook) Target entity description: Automata and Computability is a widely used theoretical computer science textbook by Dexter Kozen that introduces formal languages, automata theory, and the foundations of computability.
-
A.
"Introduction to Automata Theory, Languages, and Computation"
"Introduction to Automata Theory, Languages, and Computation" is a foundational textbook in theoretical computer science that systematically develops the theory of automata, formal languages, and computational complexity.
-
B.
Introduction to the Theory of Computation
Introduction to the Theory of Computation is a widely used textbook in theoretical computer science that covers formal languages, automata, computability, and complexity theory.
-
C.
Elements of the Theory of Computation
Elements of the Theory of Computation is a foundational textbook that introduces the mathematical and theoretical principles underlying computer science, including automata, formal languages, and computability.
-
D.
Finite Automata and Their Decision Problems
"Finite Automata and Their Decision Problems" is a landmark 1959 paper by Dana Scott and Michael Rabin that founded the modern theory of finite automata and formalized key decision problems in automata theory and computation.
-
E.
Automata Theory
Automata Theory is a branch of theoretical computer science that studies abstract computational models and the problems they can solve, forming a foundation for formal languages, compilers, and complexity theory.
- 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_69ca84e314108190978324a4bdb959f8 |
completed | March 30, 2026, 2:12 p.m. |
| NER | Named-entity recognition | batch_69cdb34921b881909836ba0f5b42a27b |
completed | April 2, 2026, 12:07 a.m. |
| NED1 | Entity disambiguation (via context triple) | batch_69d1e429682c8190a94339b96d4081f6 |
completed | April 5, 2026, 4:25 a.m. |
| NEDg | Description generation | batch_69d1e50214888190a93a9a27cc3f203f |
completed | April 5, 2026, 4:28 a.m. |
| NED2 | Entity disambiguation (via description) | batch_69d1e5659fd88190bcee1dc2851df117 |
completed | April 5, 2026, 4:30 a.m. |
Created at: March 30, 2026, 8:33 p.m.