Triple

T1531828
Position Surface form Disambiguated ID Type / Status
Subject Introduction to the Theory of Computation E32458 entity
Predicate relatedTo P37 FINISHED
Object Introduction to Automata Theory, Languages, and Computation E32458 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: Introduction to Automata Theory, Languages, and Computation | Statement: [Introduction to the Theory of Computation, relatedTo, Introduction to Automata Theory, Languages, and Computation]
NED1 Entity disambiguation (via context triple) gpt-5-mini-2025-08-07 
Target entity: Introduction to Automata Theory, Languages, and Computation
Context triple: [Introduction to the Theory of Computation, relatedTo, Introduction to Automata Theory, Languages, and Computation]
  • A. Introduction to the Theory of Computation chosen
    Introduction to the Theory of Computation is a widely used textbook in theoretical computer science that covers formal languages, automata, computability, and complexity theory.
  • B. 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.
  • C. Introduction to Algorithms
    Introduction to Algorithms is a widely used, comprehensive textbook on algorithms and data structures, renowned for its rigorous yet accessible coverage of theoretical and practical topics in computer science.
  • D. Chomsky hierarchy
    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.
  • E. Mathematical Structures of Language
    Mathematical Structures of Language is a foundational work in mathematical linguistics that applies formal and algebraic methods to analyze the structure of natural languages.
  • 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_69a885ea86308190998f6bc14bb91f8e completed March 4, 2026, 7:20 p.m.
NER Named-entity recognition batch_69a90816b5e88190aa92a8558e35744b completed March 5, 2026, 4:35 a.m.
NED1 Entity disambiguation (via context triple) batch_69ad2957e6e4819087504a16bc32d60b completed March 8, 2026, 7:46 a.m.
Created at: March 4, 2026, 7:26 p.m.