Viterbi algorithm (Viterbi algorithm) is a type of dynamic programming algorithm that searches for the most plausible sequence of hidden states (called a Viterbi path) resulting from an observed sequence of events.
- Used in hidden Markov model, but not exclusively Given a DAG, find the path that maximizes the score, type dynamic programming.
This page is auto-translated from /nishio/Viterbiアルゴリズム using DeepL. If you looks something interesting but the auto-translated English is not good enough to understand it, feel free to let me know at @nishio_en. I’m very happy to spread my thought to non-Japanese readers.