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

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?

Step by Step Solution

3.22 Rating (157 Votes )

There are 3 Steps involved in it

1 Expert Approved Answer
Step: 1 Unlock

a In the Viterbi algorithm processing the probabilistic finite state machine new is seen as a better ... View full answer

blur-text-image
Question Has Been Solved by an Expert!

Get step-by-step solutions from verified subject matter experts

Step: 2 Unlock
Step: 3 Unlock

Students Have Also Explored These Related Artificial Intelligence Structures Questions!