Hi Zhen,
For both the forwards and backwards algorithms, you
can call them in the same way as viterbi. This will
just give you back the score. You can also call them
with an explicit dynamic programming matrix. In this
case, you get the matrix back with all the values
filled in. Both Forward and B
Hi, there,
The three main DP operations are Forwards, Backwards and Viterbi. Forwards and
Backwards calculate the probability of the sequences having been made in any way by
the model. Viterbi finds the most supported way that the sequence could have been made.
I have seen the Dice example that