Triple
T3744692
| Position | Surface form | Disambiguated ID | Type / Status |
|---|---|---|---|
| Subject | Dijkstra |
E79781
|
entity |
| Predicate | notableConcept |
P201
|
FINISHED |
| Object | shunting-yard algorithm |
E79783
|
NE FINISHED |
How this triple was built (2 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: [Dijkstra, notableConcept, shunting-yard algorithm]
NED1
Entity disambiguation (via context triple)
gpt-5-mini-2025-08-07
Target entity: shunting-yard algorithm Context triple: [Dijkstra, notableConcept, 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.
Marzullo's algorithm
Marzullo's algorithm is a method for selecting the most likely correct time interval from multiple, possibly conflicting time sources, commonly used in clock synchronization systems.
-
D.
Mathematike Syntaxis
Mathematike Syntaxis, better known by its later Arabic-derived title Almagest, is Ptolemy’s foundational astronomical treatise that systematically presents the geocentric model of the cosmos and dominated Western and Islamic astronomy for over a millennium.
-
E.
Thompson's algorithm
Thompson's algorithm is a classic computer science method for converting regular expressions into nondeterministic finite automata (NFAs), widely used in pattern matching and lexical analysis.
- F. None of above.
- G. Unsure - the case is ambiguous/there is not enough information to decide.
Provenance (3 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_69ad8b115610819095b02007da5ca3cb |
completed | March 8, 2026, 2:43 p.m. |
| NER | Named-entity recognition | batch_69adcb58c9048190a055d1f4a7e6b699 |
completed | March 8, 2026, 7:17 p.m. |
| NED1 | Entity disambiguation (via context triple) | batch_69b4db29b2288190932923a6bf1a7e8e |
completed | March 14, 2026, 3:51 a.m. |
Created at: March 8, 2026, 3:34 p.m.