Hidden Markov Model
From lingwiki
(Difference between revisions)
m (1 revision) |
Current revision
A Hidden Markov Model (HMM) is a kind of statistical model, or probabilistic function of a Markov Chain. These models are commonly associated with the question, "Given an observed output sequence, which state sequence is most likely to have caused it?" Unknown parameters are assumed to exist in the model that can be derived from the observable parameters. HMMs are hence used to model data generation; given some sample data, we want to construct a model that will account for future data whose type is the same of that given in the sample.
[edit] Formal Definition
If one defines
- An output alphabet, Y = {0,1,...,b − 1}
- A state space, S = {1,2,...,c} with a unique starting space s0
- A probability distribution of transitions between states p(s' | s)
- An output probability distribution q(y | s,s') associated with transitions from state s to state s',
then the probability of observing an HMM output string y1,y2,...,yk is given by
[edit] Use in Speech Recognition
HMMs are used in the construction of acoustic models and language models.
