What does the Viterbi algorithm compute?
Answer: D
Viterbi finds the sequence maximising the joint probability, which is not the same as taking the most likely state at each step independently, since the latter may produce a sequence with zero probability of occurring. The forward algorithm gives the sequence probability and the Baum Welch algorithm estimates parameters. That a sequence of individually best choices need not be the best sequence is a general point about joint optimisation worth recognising.
Please log in or register to report this question.