Triple
T6594134
| Position | Surface form | Disambiguated ID | Type / Status |
|---|---|---|---|
| Subject | Stephen Kleene |
E148433
|
entity |
| Predicate | influenced |
P9
|
FINISHED |
| Object | formal language theory |
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: formal language theory | Statement: [Stephen Kleene, influenced, formal language theory]
NED1
Entity disambiguation (via context triple)
gpt-5-mini-2025-08-07
Target entity: formal language theory Context triple: [Stephen Kleene, influenced, formal language theory]
-
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.
Sprachtheorie
Sprachtheorie is Karl Bühler’s influential work in linguistic theory, best known for its functional model of language and the “organon” theory of signs.
-
C.
"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.
-
D.
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.
-
E.
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.
- 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_69c687e7b8688190811ffee72e096468 |
completed | March 27, 2026, 1:36 p.m. |
| NER | Named-entity recognition | batch_69c6aed0b364819081cb02af7a38ef11 |
completed | March 27, 2026, 4:22 p.m. |
| NED1 | Entity disambiguation (via context triple) | batch_69c6cbba656c81909c3876a8f2f7300e |
completed | March 27, 2026, 6:26 p.m. |
Created at: March 27, 2026, 1:55 p.m.