Triple

T22445178
Position Surface form Disambiguated ID Type / Status
Subject Landin’s SECD machine E554845 entity
Predicate influenced P9 FINISHED
Object Krivine machine — NE NERFINISHED

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: Krivine machine | Statement: [Landin’s SECD machine, influenced, Krivine machine]

Disambiguation candidates (2 decisions)

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: Krivine machine
Context triple: [Landin’s SECD machine, influenced, Krivine machine]
  • A. Landin’s SECD machine
    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. 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.
  • C. Knuth–Bendix completion algorithm
    The Knuth–Bendix completion algorithm is a procedure in term rewriting and automated theorem proving that transforms a set of equations into a confluent rewriting system, enabling decision of word problems in algebraic structures.
  • 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. Church–Rosser property
    The Church–Rosser property is a confluence property of rewriting systems stating that if an expression can be reduced in different ways, all reduction paths can be further reduced to a common equivalent form.
  • F. None of above. chosen
  • G. Unsure - the case is ambiguous/there is not enough information to decide.
NED2 Entity disambiguation (via description) gpt-5-mini-2025-08-07 
Target entity: Krivine machine
Target entity description: The Krivine machine is an abstract machine used to implement call-by-name evaluation of lambda calculus expressions, particularly in the context of functional programming language semantics.
  • A. Landin’s SECD machine
    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. 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.
  • C. Knuth–Bendix completion algorithm
    The Knuth–Bendix completion algorithm is a procedure in term rewriting and automated theorem proving that transforms a set of equations into a confluent rewriting system, enabling decision of word problems in algebraic structures.
  • 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. Church–Rosser property
    The Church–Rosser property is a confluence property of rewriting systems stating that if an expression can be reduced in different ways, all reduction paths can be further reduced to a common equivalent form.
  • F. None of above. chosen

Provenance (2 batches)

Stage Batch ID Job type Status
creating batch_69e11e5113208190ab58c6b595f9d1d0 elicitation completed
NER batch_69f15b46e8ac8190bfa8c611ffcba822 ner completed
Created at: April 16, 2026, 8:47 p.m.