Triple

T10700878
Position Surface form Disambiguated ID Type / Status
Subject Viterbi algorithm E252270 entity
Predicate comparedTo P278 FINISHED
Object forward-backward algorithm
The forward-backward algorithm is a dynamic programming method for computing posterior state probabilities in hidden Markov models, widely used in tasks like sequence labeling and speech recognition.
E880218 NE FINISHED

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: forward-backward algorithm | Statement: [Viterbi algorithm, comparedTo, forward-backward algorithm]
NED1 Entity disambiguation (via context triple) gpt-5-mini-2025-08-07
Target entity: forward-backward algorithm
Context triple: [Viterbi algorithm, comparedTo, forward-backward algorithm]
  • A. Viterbi algorithm
    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. Gibbs sampling
    Gibbs sampling is a Markov chain Monte Carlo algorithm that generates samples from complex multivariate probability distributions by iteratively sampling each variable from its conditional distribution given the others.
  • D. Bayes factor
    The Bayes factor is a Bayesian model comparison metric that quantifies how much more strongly data support one statistical model or hypothesis over another.
  • E. 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.
  • F. None of above. chosen
  • G. Unsure - the case is ambiguous/there is not enough information to decide.
NEDg Description generation gpt-5.1
Instruction
Generate a one-sentence description of the target entity. 
You are given a context triple in the form (subject, predicate, object), where the object is the target entity. 
# Instructions
Use the triple to infer relevant information about the entity. Describe the entity based on what is most defining, well-known. 
Avoid repeating the information from the triple, unless really essential.
# Response Format
Return only the sentence: "Description: [one-sentence description of the target entity]"
Input
Entity: forward-backward algorithm
Triple: [Viterbi algorithm, comparedTo, forward-backward algorithm]
Generated description
The forward-backward algorithm is a dynamic programming method for computing posterior state probabilities in hidden Markov models, widely used in tasks like sequence labeling and speech recognition.
NED2 Entity disambiguation (via description) gpt-5-mini-2025-08-07
Target entity: forward-backward algorithm
Target entity description: The forward-backward algorithm is a dynamic programming method for computing posterior state probabilities in hidden Markov models, widely used in tasks like sequence labeling and speech recognition.
  • A. Viterbi algorithm
    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. Gibbs sampling
    Gibbs sampling is a Markov chain Monte Carlo algorithm that generates samples from complex multivariate probability distributions by iteratively sampling each variable from its conditional distribution given the others.
  • D. Bayes factor
    The Bayes factor is a Bayesian model comparison metric that quantifies how much more strongly data support one statistical model or hypothesis over another.
  • E. 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.
  • F. None of above. chosen

Provenance (5 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.
NEDg Description generation batch_69d99e8534688190b312b737e0b9cd53 completed April 11, 2026, 1:06 a.m.
NED2 Entity disambiguation (via description) batch_69da625a1e8c8190b282e7a70bb7c876 completed April 11, 2026, 3:01 p.m.
Created at: April 8, 2026, 9:12 p.m.