Triple
T5923143
| Position | Surface form | Disambiguated ID | Type / Status |
|---|---|---|---|
| Subject | ISWIM |
E131742
|
entity |
| Predicate | relatedTo |
P37
|
FINISHED |
| Object | SECD machine |
E554845
|
NE FINISHED |
Named-entity recognition
Before disambiguation, gpt-5-mini classified whether the object phrase is a named entity — the step behind the object's NE type shown above.
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: SECD machine | Statement: [ISWIM, relatedTo, SECD machine]
Disambiguation candidates (1 decision)
The exact options the model was shown at each disambiguation step, with the option it chose highlighted — the evidence behind this triple's disambiguated ids.
NED1
Entity disambiguation (via context triple)
gpt-5-mini-2025-08-07
Target entity: SECD machine Context triple: [ISWIM, relatedTo, SECD machine]
-
A.
Landin’s SECD machine
chosen
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.
-
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.
Scheme: An Interpreter for Extended Lambda Calculus
"Scheme: An Interpreter for Extended Lambda Calculus" is the seminal 1975 technical report by Gerald Jay Sussman and Guy L. Steele Jr. that introduced the Scheme programming language and demonstrated the power of lexical scoping and first-class procedures in a minimalist Lisp dialect.
-
D.
Computing with Register Machines
"Computing with Register Machines" is a chapter in the classic computer science textbook *Structure and Interpretation of Computer Programs* that introduces low-level machine models and shows how higher-level language constructs can be implemented using simple register-based operations.
-
E.
Scheme48 virtual machine
The Scheme48 virtual machine is a lightweight, portable runtime system designed to efficiently execute programs written in the Scheme48 dialect of the Scheme programming language.
- F. None of above.
- G. Unsure - the case is ambiguous/there is not enough information to decide.
Provenance (3 batches)
| Stage | Batch ID | Job type | Status |
|---|---|---|---|
| creating | batch_69c0085a1ed08190a7e9a8b6323fd680 |
elicitation | completed |
| NER | batch_69c03804d9808190829a418adb7864aa |
ner | completed |
| NED1 | batch_69c108186c64819088c21e9b5408d5f1 |
ned_source_triple | completed |
Created at: March 22, 2026, 4 p.m.