Skip to content

Latest commit

 

History

History
10 lines (8 loc) · 507 Bytes

File metadata and controls

10 lines (8 loc) · 507 Bytes

On page flawed-viterbi-page, we outlined a flawed procedure for finding the most likely state sequence, given an observation sequence. The procedure involves finding the most likely state at each time step, using smoothing, and returning the sequence composed of these states. Show that, for some temporal probability models and observation sequences, this procedure returns an impossible state sequence (i.e., the posterior probability of the sequence is zero).