Discussion
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.
No comment is present. Be the first to comment.
Loading…
Post your comment
Please log in or register to post a comment.
Examination Categories
- SSC Exams
- Banking Exams
- Teaching Exams
- Civil Services Exams
- Railways Exams
- Engineering Recruitment Exams
- Defence Exams
- State Government Exams
- Police Exams
- Insurance Exams
- Nursing Exams
- Other Government Exams
- NRA CET
- PG Entrance Exams
- Campus Placement
- MBA Entrance Exams
- CUET and UG Entrance
- Judiciary Exams
- Regulatory Body Exams
- Software Development