Revision as of 14:12, 29 August 2005 edit Ruud Koot (talk \| contribs) 31,416 edits →Extensions: see also ← Previous edit		Revision as of 12:53, 17 October 2005 edit undo 84.93.31.44 (talk) →A Concrete Example Next edit →
Line 7: The terms "Viterbi path" and "Viterbi algorithm" are also applied to related dynamic programming algorithms that discover the single most likely explanation for an observation. For example, in stochastic [[parser\|parsing]] a dynamic programming algorithm can be used to discover the single most likely context-free derivation (parse) of a string, which is sometimes called the "Viterbi parse". ===A concrete example=== {{HMM example}}

Viterbi algorithm: Difference between revisions