You are here:Home Courses Archived courses Speech Processing (up to 2016-17) Automatic speech recognition Hidden Markov Models Algorithms for recognition Computing P(O|W) with an HMM Token passing

Token passing

This is a really nice way to understand, and to implement, dynamic programming in HMMs.
5 minutes 53 seconds

Related post

CUI 2024 slides available
Token passing

Reading

Young et al: Token Passing

My favourite way of understanding how the Viterbi algorithm is applied to HMMs. Can also be helpful in understanding search for unit selection speech synthesis.

Excellent 0
Very helpful 1
Quite helpful 3
Slightly helpful 1
Confusing 2
No rating 0
My brain hurts 0
Really quite difficult 2
Getting harder 2
Just right 3
Pretty simple 0
No rating 0