Triple
T10055627
| Position | Surface form | Disambiguated ID | Type / Status |
|---|---|---|---|
| Subject | Grundzüge der theoretischen Logik |
E208853
|
entity |
| Predicate | influenced |
P9
|
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: [Grundzüge der theoretischen Logik, influenced, Haskell Curry]
NED1
Entity disambiguation (via context triple)
gpt-5-mini-2025-08-07
Target entity: Haskell Curry Context triple: [Grundzüge der theoretischen Logik, influenced, 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.
Emil Post
Emil Post was a pioneering logician and mathematician whose work on recursive functions, production systems, and undecidability helped lay the foundations of modern computability theory.
-
D.
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.
-
E.
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.
- 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_69ca836094408190a36a1ea7e9a86fcd |
completed | March 30, 2026, 2:06 p.m. |
| NER | Named-entity recognition | batch_69cdcfacacd08190abe66f8bb17b92c7 |
completed | April 2, 2026, 2:08 a.m. |
| NED1 | Entity disambiguation (via context triple) | batch_69d2b61869208190ab67a28e2aa8f8ec |
completed | April 5, 2026, 7:20 p.m. |
Created at: March 30, 2026, 8:57 p.m.