Hidden Markov Model in Automatic Speech Recognition Z. Fodroczi Pazmany Peter Catholic. Univ

 Sana 10.01.2019 Hajmi 353 Kb. #58744

• Your school teacher gave three dierent types of daily homework assignments:

• A: took about 5 minutes to complete
• B: took about 1 hour to complete
• C: took about 3 hours to complete

• One week, your teacher gave the following homework assignments:

• Monday: A
• Tuesday: C
• Wednesday: B
• Thursday: A
• Friday: C

• How do we adjust the model parameters λ(S,aij,ei(x)) to maximize P(O| λ)

• (create a HMM for a given sequence set)

• Given:

• Hidden Markov model: S, akl ,Σ ,ek(x)
• Observed symbol sequence E = x1x2, … xn.

• Most probable mood curve:

• Day: Mon Tue Wed Thu Fri
• Assignment: A C B A C

• Matrix fk(i), where k€Sand 1 <= i <= n.

• Initialization: fk(1) = ek(x1)=#states for all states k€S .
• fl(i) = el(xi)Pk(fk(i - 1)akl) for all states k€S , i <=2.

• Extensions:

• continuous observation probability density function
• mixture of Gaussian pdfs

• Typical state-of-the-art large-vocabulary ASR system:

• - speaker independent
• - 64k word vocabulary
• - trigram (2-word context) language model
• - multiple pronunciations for each word
• - triphone or quinphone HMM-based acoustic model
• - 100-300X real-time recognition
• - WER 10%-50%

• Computationally intensive

• 50 phones = 125000 possible triphones
• 3 states per triphone
• 3 Gaussian mixture for each state
• 64k word vocabulary
• 262 trillion trigrams
• 2-20 phonemes per word in 64k vocabulary
• 39 dimensional feature vector sampled every 10ms
• 100 frame per second

Do'stlaringiz bilan baham:

Ma'lumotlar bazasi mualliflik huquqi bilan himoyalangan ©fayllar.org 2023
ma'muriyatiga murojaat qiling