Given the example of the Viterbi algorithm processing the probabilistic finite state machine of Figure 13.7 and

Question:

Given the example of the Viterbi algorithm processing the probabilistic finite state machine of Figure 13.7 and 13.8:

 Figure 13.7

neat .00013 need .00056 new .001 knee .000024 Start # n n .36 n .64 n iv iy iy (unt (iv) 48 89 .52 .11 End #

Figure 13.8

Start = 1.0 neat .00013 2 paths need .00056 2 paths new .001 2 paths knee .000024 1 path Total best # 1.0 1.0 

a. Why is new seen as a better interpretation than knee for the observed phones?

b. How are alternative states in the probabilistic finite state machine handled by the Viterbi algorithm, for example, the choice of the phones uw and iy in the word new?

Fantastic news! We've Found the answer you've been seeking!

Step by Step Answer:

Question Posted: