Viterbi algorithm: Difference between revisions

Revision as of 21:54, 1 June 2004

Revision as of 02:02, 30 June 2004

Line 1:

The '''Viterbi [[algorithm]]''', named after its developer [[Andrew Viterbi]], is a way to find the most [[likelihood|likely]] sequence of hidden states (or causes) that result in a sequence of observed events. It was originally conceived as an [[error-correction]] scheme for noisy digital communication links, finding universal application in decoding the [[convolutional code]]s used in [[CDMA]] and [[GSM]] digital cellular, dial modems, satellite and deep-space communications, and [[802.11]] wireless LANs. It is now also commonly used in [[information theory]], [[speech recognition]] and, [[computational linguistics]]., and [[bioinformatics]]. For example, in speech-to-text speech recognition, the acoustic signal is treated as the observed sequence of events, and a string of text is considered to be the "hidden cause" of the acoustic signal. The Viterbi algorithm finds thisthe hiddenmost causelikely ifstring itof istext given the acoustic signal.

The algorithm is not general; it makes a number of assumptions. First, both the observed events and hidden events must be in a sequence. This sequence often corresponds to time. Second, these two sequences need to be aligned, and an observed event needs to correspond to exactly one hidden event. Third, computing the most likely hidden sequence up to a certain point t must only depend on the observed event at point t, and the most likely sequence at point t-1.