Triple
T1255175
| Position | Surface form | Disambiguated ID | Type / Status |
|---|---|---|---|
| Subject | lambda calculus |
E26971
|
entity |
| Predicate | influenced |
P9
|
FINISHED |
| Object | Scheme |
E24474
|
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: Scheme | Statement: [lambda calculus, influenced, Scheme]
NED1
Entity disambiguation (via context triple)
gpt-5-mini-2025-08-07
Target entity: Scheme Context triple: [lambda calculus, influenced, Scheme]
-
A.
Scheme
chosen
Scheme is a minimalist, lexically scoped dialect of the Lisp programming language known for its elegant functional programming model and powerful macro system.
-
B.
Chez Scheme
Chez Scheme is a high-performance, optimizing implementation of the Scheme programming language widely used for both research and production systems.
-
C.
Racket
Racket is a modern, multi-paradigm programming language in the Lisp/Scheme family, designed for language-oriented programming, scripting, and education.
-
D.
MIT Scheme
MIT Scheme is a long-standing, feature-rich implementation of the Scheme programming language developed at the Massachusetts Institute of Technology, often used for teaching and research in computer science.
-
E.
Gambit Scheme
Gambit Scheme is a high-performance implementation of the Scheme programming language, known for its efficient compiler, support for concurrent and distributed programming, and ability to generate C code for portability.
- 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_69a49487a9c48190ba9b05348fd1b53f |
completed | March 1, 2026, 7:33 p.m. |
| NER | Named-entity recognition | batch_69a4bfa5a4cc819093ed686619b572d8 |
completed | March 1, 2026, 10:37 p.m. |
| NED1 | Entity disambiguation (via context triple) | batch_69ac93cb76248190a23acb2e76ecfa8d |
completed | March 7, 2026, 9:08 p.m. |
Created at: March 1, 2026, 7:47 p.m.