Triple

T9632764
Position Surface form Disambiguated ID Type / Status
Subject Reverse Polish Notation E232845 entity
Predicate isConvertedUsing P48524 FINISHED
Object shunting-yard algorithm E79783 NE FINISHED

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: shunting-yard algorithm | Statement: [Reverse Polish Notation, isConvertedUsing, shunting-yard algorithm]
NED1 Entity disambiguation (via context triple) gpt-5-mini-2025-08-07 
Target entity: shunting-yard algorithm
Context triple: [Reverse Polish Notation, isConvertedUsing, shunting-yard algorithm]
  • A. shunting-yard algorithm chosen
    The shunting-yard algorithm is a method for parsing mathematical expressions and converting infix notation to postfix (or prefix) form using a stack-based procedure.
  • B. Reverse Polish Notation
    Reverse Polish Notation is a mathematical expression format that places operators after their operands, eliminating the need for parentheses and simplifying stack-based computation.
  • C. ONP
    ONP is the IATA airport code for Newport Municipal Airport in Newport, Oregon, United States.
  • D. 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.
  • E. Van Wijngaarden grammars
    Van Wijngaarden grammars are a highly expressive formal grammar formalism, introduced for defining complex programming language syntax and semantics, notably used in the specification of ALGOL 68.
  • F. None of above.
  • G. Unsure - the case is ambiguous/there is not enough information to decide.
PD Predicate disambiguation gpt-5-mini-2025-08-07 
Target predicate: isConvertedUsing
Context triple: [Reverse Polish Notation, isConvertedUsing, shunting-yard algorithm]
  • A. convertedBy
    Indicates that one entity has been transformed or changed in form, state, or representation through the action or process performed by another entity.
  • B. isForcedToConvertTo
    Indicates that one entity is compelled, against its will, to change its beliefs, affiliation, or status to match that of another entity.
  • C. allowsConversionTo
    Indicates that one entity permits or enables transformation or change into another specified form or state.
  • D. convertsTo
    Indicates that one entity is transformed or changed into another entity, typically resulting in a different state, form, or representation.
  • E. methodOfConversion chosen
    Indicates the specific process or technique used to transform one form, state, or representation into another.
  • F. None of above.

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_69ca848940cc8190b97cec654cb3bb4a completed March 30, 2026, 2:11 p.m.
NER Named-entity recognition batch_69cd9b2783b48190a9929dc3e3cd2956 completed April 1, 2026, 10:24 p.m.
NED1 Entity disambiguation (via context triple) batch_69d18232e34c8190a19685ee9210e88b completed April 4, 2026, 9:27 p.m.
PD Predicate disambiguation batch_69ccd5acfa5c8190aaba3cf548723604 completed April 1, 2026, 8:22 a.m.
Created at: March 30, 2026, 8:11 p.m.