 
 19 Nov
 1999
 
 Sphinx
 Speech Group, CMU-SCS (rkm@cs.cmu.edu)
 
 
 Viterbi Search (contd.)
 


 
 time
 

 
 State with best path-score
 State with path-score < best
 State without a valid path-score
 P (t)
 j
 = max [P (t-1) a   b  (t)]
 i
 ij
 j
 i
 Total path-score ending up at state j at time t
 State transition probability, i to j
 Score for state j, given the input at time t
 

