Triple
T9810362
| Position | Surface form | Disambiguated ID | Type / Status |
|---|---|---|---|
| Subject | Theoretical Computer Science |
E238251
|
entity |
| Predicate | hasSubfield |
P5461
|
FINISHED |
| Object |
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.
|
E822916
|
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: Formal Language Theory | Statement: [Theoretical Computer Science, hasSubfield, Formal Language Theory]
NED1
Entity disambiguation (via context triple)
gpt-5-mini-2025-08-07
Target entity: Formal Language Theory Context triple: [Theoretical Computer Science, hasSubfield, Formal Language Theory]
-
A.
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.
-
B.
"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.
-
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.
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.
-
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. 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: Formal Language Theory Triple: [Theoretical Computer Science, hasSubfield, Formal Language Theory]
Generated description
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.
NED2
Entity disambiguation (via description)
gpt-5-mini-2025-08-07
Target entity: Formal Language Theory Target entity description: 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.
-
A.
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.
-
B.
"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.
-
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.
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.
-
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. 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_69ca84defac48190abc1148804f184c1 |
completed | March 30, 2026, 2:12 p.m. |
| NER | Named-entity recognition | batch_69cdb220310c8190a16ca0b746f0ef7a |
completed | April 2, 2026, 12:02 a.m. |
| NED1 | Entity disambiguation (via context triple) | batch_69d1cc5b4dd8819088c86946b4eb8a39 |
completed | April 5, 2026, 2:43 a.m. |
| NEDg | Description generation | batch_69d1cd7f41448190b387109235dbc7f5 |
completed | April 5, 2026, 2:48 a.m. |
| NED2 | Entity disambiguation (via description) | batch_69d1cdefca5c8190a673caca42aaa7d0 |
completed | April 5, 2026, 2:50 a.m. |
Created at: March 30, 2026, 8:30 p.m.