Hidden Markov Model
Hidden Markov Models
A Hidden Markov Model(,,) consists of the following elements:
1. is a positive integer specifying the number of states in the model. Without loss of generality, we will take the th state to be a special state, the final or stop state.
2. is a set of output symbols, for example
3. is a vector of parameters. It contains three types of parameters:
for is the probability of choosing state as an initial state. Note that
for
is the probability of transitioning from state j to state k. Note that for all j,
for , and ,
is the probability of emitting symbol from state j. Note that for all ,
.
Thus it can be seen that is a vector of parameters.
An HMM specifies a probability for each possible pair, where x is a sequence of symbols drawn from , and y is a sequence of states drawn from the integers . The sequences and are restricted to have the same length. As an example, say we have an HMM with , and with some choice of the parameters . Take and . Then in this case,
Thus we have a product of terms specifying the probability of emitting each symbol from its associated state.
In general, if we have the sequence , and the sequence ,
Thus we see that the probability is a simple function of the prameters .