Triple
T211709
| Position | Surface form | Disambiguated ID | Type / Status |
|---|---|---|---|
| Subject | Alonzo Church |
E4733
|
entity |
| Predicate | knownFor |
P22
|
FINISHED |
| Object |
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.
|
E26971
|
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: lambda calculus | Statement: [Alonzo Church, knownFor, lambda calculus]
NED1
Entity disambiguation (via context triple)
gpt-5-mini-2025-08-07
Target entity: lambda calculus Context triple: [Alonzo Church, knownFor, lambda calculus]
-
A.
Scheme
Scheme is a minimalist, lexically scoped dialect of the Lisp programming language known for its elegant functional programming model and powerful macro system.
-
B.
Turing machine
A Turing machine is an abstract computational model that manipulates symbols on an infinite tape according to a set of rules, providing a formal foundation for the concept of algorithm and computability.
-
C.
ALGOL 60
ALGOL 60 is an early high-level programming language that pioneered block structure and lexical scoping, profoundly influencing the design of many later languages.
-
D.
ReasonML
ReasonML is a syntax and toolchain for the OCaml language that offers a JavaScript-friendly, type-safe alternative for building web and native applications.
-
E.
On Computable Numbers with an Application to the Entscheidungsproblem
"On Computable Numbers, with an Application to the Entscheidungsproblem" is Alan Turing’s landmark 1936 paper that introduced the Turing machine model and founded the formal study of computability and the limits of algorithmic decision procedures.
- 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: lambda calculus Triple: [Alonzo Church, knownFor, lambda calculus]
Generated description
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.
NED2
Entity disambiguation (via description)
gpt-5-mini-2025-08-07
Target entity: lambda calculus Target entity description: 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.
-
A.
Scheme
Scheme is a minimalist, lexically scoped dialect of the Lisp programming language known for its elegant functional programming model and powerful macro system.
-
B.
Turing machine
A Turing machine is an abstract computational model that manipulates symbols on an infinite tape according to a set of rules, providing a formal foundation for the concept of algorithm and computability.
-
C.
ALGOL 60
ALGOL 60 is an early high-level programming language that pioneered block structure and lexical scoping, profoundly influencing the design of many later languages.
-
D.
ReasonML
ReasonML is a syntax and toolchain for the OCaml language that offers a JavaScript-friendly, type-safe alternative for building web and native applications.
-
E.
On Computable Numbers with an Application to the Entscheidungsproblem
"On Computable Numbers, with an Application to the Entscheidungsproblem" is Alan Turing’s landmark 1936 paper that introduced the Turing machine model and founded the formal study of computability and the limits of algorithmic decision procedures.
- 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_69a2575cb1dc8190a01ad332426dc339 |
completed | Feb. 28, 2026, 2:47 a.m. |
| NER | Named-entity recognition | batch_69a25c2fd0648190bae9191a84129709 |
completed | Feb. 28, 2026, 3:08 a.m. |
| NED1 | Entity disambiguation (via context triple) | batch_69a332cb28e08190a4e159b2631f5eb8 |
completed | Feb. 28, 2026, 6:24 p.m. |
| NEDg | Description generation | batch_69a333537ae481909f16bc4b37303d8c |
completed | Feb. 28, 2026, 6:26 p.m. |
| NED2 | Entity disambiguation (via description) | batch_69a333f5868c819083234c015ec243a5 |
completed | Feb. 28, 2026, 6:29 p.m. |
Created at: Feb. 28, 2026, 2:52 a.m.