Triple

T21423467
Position Surface form Disambiguated ID Type / Status
Subject Spellbreaker E528493 entity
Predicate hasTextParser P143908 FINISHED
Object Infocom parser NE NERFINISHED

How this triple was built (4 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: Infocom parser | Statement: [Spellbreaker, hasTextParser, Infocom parser]
NED1 Entity disambiguation (via context triple) gpt-5-mini-2025-08-07
Target entity: Infocom parser
Context triple: [Spellbreaker, hasTextParser, Infocom parser]
  • A. Parspace
    Parspace is a track from Stereolab’s influential 1997 album "Dots and Loops," known for its blend of experimental pop, lounge, and electronic influences.
  • B. Pratt parsing technique
    Pratt parsing technique is a top-down operator precedence parsing method for efficiently analyzing expressions in programming language compilers and interpreters.
  • C. Standard for the Format of ARPA Internet Text Messages
    Standard for the Format of ARPA Internet Text Messages is the seminal specification that defined the syntax and structure of electronic mail messages on the early ARPANET, forming the basis for modern Internet email formats.
  • D. Link Grammar
    Link Grammar is a syntactic parsing framework that connects words in a sentence via labeled links according to a lexicon of linking requirements, providing a rule-based alternative to traditional phrase-structure grammars.
  • E. Aho–Ullman algorithms for parsing
    Aho–Ullman algorithms for parsing are foundational compiler-construction techniques that efficiently analyze and translate the syntactic structure of programming languages based on formal grammar theory.
  • 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: Infocom parser
Target entity description: The Infocom parser is an advanced natural-language command interpreter used in classic Infocom text adventure games to understand complex player input.
  • A. Parspace
    Parspace is a track from Stereolab’s influential 1997 album "Dots and Loops," known for its blend of experimental pop, lounge, and electronic influences.
  • B. Pratt parsing technique
    Pratt parsing technique is a top-down operator precedence parsing method for efficiently analyzing expressions in programming language compilers and interpreters.
  • C. Standard for the Format of ARPA Internet Text Messages
    Standard for the Format of ARPA Internet Text Messages is the seminal specification that defined the syntax and structure of electronic mail messages on the early ARPANET, forming the basis for modern Internet email formats.
  • D. Link Grammar
    Link Grammar is a syntactic parsing framework that connects words in a sentence via labeled links according to a lexicon of linking requirements, providing a rule-based alternative to traditional phrase-structure grammars.
  • E. Aho–Ullman algorithms for parsing
    Aho–Ullman algorithms for parsing are foundational compiler-construction techniques that efficiently analyze and translate the syntactic structure of programming languages based on formal grammar theory.
  • F. None of above. chosen
PD Predicate disambiguation gpt-5-mini-2025-08-07
Target predicate: hasTextParser
Context triple: [Spellbreaker, hasTextParser, Infocom parser]
  • A. hasText
    Indicates that an entity is associated with or contains a specific piece of textual content.
  • B. hasTextElement
    Indicates that an entity contains or is associated with a specific text-based component or segment.
  • C. hasTextualCharacter
    Indicates that something possesses or exhibits the qualities of written or printed text, such as letters, symbols, or characters.
  • D. hasNoText
    Indicates that the referenced entity or element contains no textual content.
  • E. hasTextOpening
    Indicates that an entity begins with or contains a specified initial segment of text.
  • F. None of above. chosen

Provenance (4 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_69e0c455f3688190810bc96365791b0f completed April 16, 2026, 11:13 a.m.
NER Named-entity recognition batch_69ee8139ce848190b812d6d07f1bdef8 completed April 26, 2026, 9:18 p.m.
PD Predicate disambiguation batch_69e61639ee288190889ffd500d1260f6 completed April 20, 2026, 12:04 p.m.
PDg Predicate description generation batch_69e6190163448190a2404b396215c686 completed April 20, 2026, 12:16 p.m.
Created at: April 16, 2026, 5:48 p.m.