Changes between Version 1 and Version 2 of ViterbiAlgorithm

Ignore:
Timestamp:
Nov 11, 2013, 11:51:24 AM (6 years ago)
Comment:

complete text, the last part was left out

Unmodified
Added
Removed
Modified
• ViterbiAlgorithm

 v1 The Viterbi algorithm simply solves column by column. For the previous column each point has a best path and a associated The Viterbi algorithm simply solves column by column. For the previous column each point has a best path and an associated score: }}} To move one column forward we just need to find the best path and associated scores for the next column here are some edges we could choose from: {{{ O-----5--3--O \      \8 \       \ O  \  1--9--O \/  \3 /\     \ O  /  2--1--O /     \2 /        \ O-----2--4--O }}} Finding the new best paths and scores for each point of our new column is trivial given we know the previous column best paths and scores: {{{ O-----0-----8 \ \ O  \  0----10 \/ /\ O  /  0-----3 /     \ /        \ O     0     4 }}} The Viterbi algorithm continues exactly like this column for column until the end and then just picks the path with the best score (above that would be the one with score 3). {{{#!comment Adapted from `doc/viterbi.txt`.