Hidden Markov ModelsHMMs 隐马尔可夫模型HMM.pptVIP

Forward-backward algorithm LING 572 Fei Xia 02/23/06 Outline Forward and backward probability Expected counts and update formulae Relation with EM HMM A HMM is a tuple : A set of states S={s1, s2, …, sN}. A set of output symbols Σ={w1, …, wM}. Initial state probabilities State transition prob: A={aij}. Symbol emission prob: B={bijk} State sequence: X1…XT+1 Output sequence: o1…oT Constraints Decoding Given the observation O1,T=o1…oT, find the state sequence X1,T+1=X1 … XT+1 that maximizes P(X1,T+1 | O1,T). ? Viterbi algorithm Notation A sentence: O1,T=o1…oT, T is