Viterbi algorithm: Difference between revisions

Revision as of 12:53, 17 October 2005

Revision as of 18:44, 17 October 2005

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}}