Triple

T18724569
Position Surface form Disambiguated ID Type / Status
Subject Arvind Neelakantan E457863 entity
Predicate coAuthorOf P2389 FINISHED
Object Learning a Natural Language Interface with Neural Programmer NE NERFINISHED

How this triple was built (3 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: Learning a Natural Language Interface with Neural Programmer | Statement: [Arvind Neelakantan, coAuthorOf, Learning a Natural Language Interface with Neural Programmer]
NED1 Entity disambiguation (via context triple) gpt-5-mini-2025-08-07
Target entity: Learning a Natural Language Interface with Neural Programmer
Context triple: [Arvind Neelakantan, coAuthorOf, Learning a Natural Language Interface with Neural Programmer]
  • A. Neural Programmer-Interpreters
    Neural Programmer-Interpreters are a class of neural network models designed to learn and execute programs by combining differentiable memory, control flow, and modular subroutines for complex algorithmic reasoning tasks.
  • B. “Natural Language Input for a Computer Problem-Solving System”
    “Natural Language Input for a Computer Problem-Solving System” is a seminal research paper in artificial intelligence and computational linguistics that explores how computers can understand and process human language to solve problems.
  • C. Neural Turing Machines
    Neural Turing Machines are a class of neural network architectures that augment standard networks with differentiable external memory, enabling them to learn algorithmic and sequence-based tasks in a manner analogous to Turing machines.
  • D. “A Computer Program for Understanding Natural Language”
    “A Computer Program for Understanding Natural Language” is a landmark 1968 paper by Terry Winograd that presents an early natural language understanding system capable of interpreting and executing commands in a simulated blocks world.
  • E. Winograd Schema Challenge
    The Winograd Schema Challenge is an AI benchmark test that evaluates a system’s commonsense reasoning by requiring it to resolve pronoun references in carefully constructed, ambiguous sentences that humans find easy but machines find difficult.
  • 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: Learning a Natural Language Interface with Neural Programmer
Target entity description: "Learning a Natural Language Interface with Neural Programmer" is a research paper that introduces a neural network-based system for translating natural language questions into executable programs to answer queries over structured data.
  • A. Neural Programmer-Interpreters
    Neural Programmer-Interpreters are a class of neural network models designed to learn and execute programs by combining differentiable memory, control flow, and modular subroutines for complex algorithmic reasoning tasks.
  • B. “Natural Language Input for a Computer Problem-Solving System”
    “Natural Language Input for a Computer Problem-Solving System” is a seminal research paper in artificial intelligence and computational linguistics that explores how computers can understand and process human language to solve problems.
  • C. Neural Turing Machines
    Neural Turing Machines are a class of neural network architectures that augment standard networks with differentiable external memory, enabling them to learn algorithmic and sequence-based tasks in a manner analogous to Turing machines.
  • D. “A Computer Program for Understanding Natural Language”
    “A Computer Program for Understanding Natural Language” is a landmark 1968 paper by Terry Winograd that presents an early natural language understanding system capable of interpreting and executing commands in a simulated blocks world.
  • E. Winograd Schema Challenge
    The Winograd Schema Challenge is an AI benchmark test that evaluates a system’s commonsense reasoning by requiring it to resolve pronoun references in carefully constructed, ambiguous sentences that humans find easy but machines find difficult.
  • F. None of above. chosen

Provenance (2 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_69d8d393ba9c8190a8b03b04ddbb0a09 completed April 10, 2026, 10:40 a.m.
NER Named-entity recognition batch_69e56d72d2c4819080b0d31860976b5e completed April 20, 2026, 12:04 a.m.
Created at: April 10, 2026, 11:50 a.m.