Triple
T10700856
| Position | Surface form | Disambiguated ID | Type / Status |
|---|---|---|---|
| Subject | Viterbi algorithm |
E252270
|
entity |
| Predicate | computes |
P90
|
FINISHED |
| Object | Viterbi path |
E252270
|
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: Viterbi path | Statement: [Viterbi algorithm, computes, Viterbi path]
NED1
Entity disambiguation (via context triple)
gpt-5-mini-2025-08-07
Target entity: Viterbi path Context triple: [Viterbi algorithm, computes, Viterbi path]
-
A.
Viterbi algorithm
chosen
The Viterbi algorithm is a dynamic programming method used to find the most likely sequence of hidden states in probabilistic models such as Hidden Markov Models, widely applied in fields like digital communications, speech recognition, and bioinformatics.
-
B.
Augmented Transition Network
Augmented Transition Network is a type of finite-state machine extended with stack-based memory and procedural actions, widely used in natural language processing for parsing complex sentence structures.
-
C.
Aho–Corasick algorithm
The Aho–Corasick algorithm is a classic string-searching algorithm that efficiently finds all occurrences of multiple patterns in a text using a trie-based finite-state machine.
-
D.
Markov localization
Markov localization is a probabilistic method in robotics for estimating a robot’s position by maintaining and updating a belief distribution over all possible locations based on sensor data and motion.
-
E.
Dijkstra
Dijkstra is a renowned Dutch computer scientist best known for his pioneering work in algorithms, including Dijkstra's shortest path algorithm, and for his influential contributions to programming methodology and software engineering.
- 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_69d6aa5cbabc8190973e683950d89faf |
completed | April 8, 2026, 7:19 p.m. |
| NER | Named-entity recognition | batch_69d6fd8bb7408190a350840e1df3b910 |
completed | April 9, 2026, 1:14 a.m. |
| NED1 | Entity disambiguation (via context triple) | batch_69d998ed78e481908537ae10d55e6f65 |
completed | April 11, 2026, 12:42 a.m. |
Created at: April 8, 2026, 9:12 p.m.