Triple
T23281114
| Position | Surface form | Disambiguated ID | Type / Status |
|---|---|---|---|
| Subject | combinatory logic |
E588865
|
entity |
| Predicate | relatedTo |
P37
|
FINISHED |
| Object | SKI combinator calculus |
—
|
NE NERFINISHED |
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: SKI combinator calculus | Statement: [combinatory logic, relatedTo, SKI combinator calculus]
NED1
Entity disambiguation (via context triple)
gpt-5-mini-2025-08-07
Target entity: SKI combinator calculus Context triple: [combinatory logic, relatedTo, SKI combinator calculus]
-
A.
combinatory logic
chosen
Combinatory logic is a foundational formal system in mathematical logic and computer science that eliminates variables by expressing computation through the combination of a small set of primitive functions.
-
B.
Krivine machine
The Krivine machine is an abstract machine used to implement call-by-name evaluation of lambda calculus expressions, particularly in the context of functional programming language semantics.
-
C.
lambda calculus
Lambda calculus is a formal system in mathematical logic and computer science that uses function abstraction and application to investigate computation and serves as a foundational model for programming languages.
-
D.
Landin’s SECD machine
Landin’s SECD machine is an early abstract machine for functional programming languages that introduced a systematic model for evaluating expressions using a stack, environment, control, and dump.
-
E.
Calculus of Inductive Constructions
Calculus of Inductive Constructions is a powerful type theory that combines higher-order logic with inductive types and dependent types, forming the formal foundation of the Coq proof assistant.
- F. None of above.
- G. Unsure - the case is ambiguous/there is not enough information to decide.
Provenance (2 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_69e25d16e2c08190a291de254703129e |
completed | April 17, 2026, 4:17 p.m. |
| NER | Named-entity recognition | batch_69f19642b46481909fd455acd2155792 |
completed | April 29, 2026, 5:25 a.m. |
Created at: April 17, 2026, 4:57 p.m.