Triple
T6594146
| Position | Surface form | Disambiguated ID | Type / Status |
|---|---|---|---|
| Subject | Stephen Kleene |
E148433
|
entity |
| Predicate | notableConcept |
P201
|
FINISHED |
| Object | Kleene hierarchy |
E601581
|
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: Kleene hierarchy | Statement: [Stephen Kleene, notableConcept, Kleene hierarchy]
NED1
Entity disambiguation (via context triple)
gpt-5-mini-2025-08-07
Target entity: Kleene hierarchy Context triple: [Stephen Kleene, notableConcept, Kleene hierarchy]
-
A.
Kleene hierarchy
chosen
The Kleene hierarchy is a classification of sets and predicates in arithmetic and recursion theory based on their definability and complexity, introduced by logician Stephen Kleene.
-
B.
Kleene numbering
Kleene numbering is a method in computability theory for effectively assigning natural numbers to partial recursive functions, refining Gödel numbering to study algorithmic properties of functions.
-
C.
Kleene’s normal form theorem
Kleene’s normal form theorem is a fundamental result in computability theory that characterizes all partial recursive (effectively computable) functions using a universal primitive recursive function and the μ-operator.
-
D.
Kleene
Kleene is a surname most notably associated with American mathematician Stephen Kleene, a pioneer in recursion theory and mathematical logic.
-
E.
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.
- 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_69c6e42d6ba08190beccfad588594780 |
completed | March 27, 2026, 8:10 p.m. |
Created at: March 27, 2026, 1:55 p.m.