Triple
T3478173
| Position | Surface form | Disambiguated ID | Type / Status |
|---|---|---|---|
| Subject | Curry paradox |
E73424
|
entity |
| Predicate | historicallyAttributedTo |
P4595
|
FINISHED |
| Object | Haskell Curry |
E213034
|
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: Haskell Curry | Statement: [Curry paradox, historicallyAttributedTo, Haskell Curry]
NED1
Entity disambiguation (via context triple)
gpt-5-mini-2025-08-07
Target entity: Haskell Curry Context triple: [Curry paradox, historicallyAttributedTo, Haskell Curry]
-
A.
Haskell Curry
chosen
Haskell Curry was an American mathematician and logician known for his foundational work in combinatory logic and for inspiring the name of the Haskell programming language.
-
B.
Alonzo Church
Alonzo Church was an American mathematician and logician best known for developing lambda calculus and making foundational contributions to computability theory and mathematical logic.
-
C.
Stephen Kleene
Stephen Kleene was an American mathematician and logician who made foundational contributions to recursion theory and the theory of computation, helping to formalize concepts of computability and influence modern computer science.
-
D.
Dana Scott
Dana Scott is an American logician and mathematician renowned for his foundational work in domain theory, model theory, and the semantics of programming languages, for which he received the Turing Award.
-
E.
John Backus
John Backus was an American computer scientist best known for leading the development of the Fortran programming language and contributing foundational work to programming language design and formal notation.
- 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_69ad85b3c9b08190857cae74c7f36da9 |
completed | March 8, 2026, 2:20 p.m. |
| NER | Named-entity recognition | batch_69adbb5b7584819096eadd1c5268eab1 |
completed | March 8, 2026, 6:09 p.m. |
| NED1 | Entity disambiguation (via context triple) | batch_69b373b2058081908558bdea4043b051 |
completed | March 13, 2026, 2:17 a.m. |
Created at: March 8, 2026, 3:17 p.m.