2012
DOI: 10.1007/s11771-012-1033-2
|View full text |Cite
|
Sign up to set email alerts
|

Improved hidden Markov model for speech recognition and POS tagging

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1
1

Citation Types

0
2
0

Year Published

2013
2013
2022
2022

Publication Types

Select...
4
2

Relationship

0
6

Authors

Journals

citations
Cited by 7 publications
(5 citation statements)
references
References 13 publications
0
2
0
Order By: Relevance
“…Analysing the base Viterbi algorithm, we have found that, one step t (t = 2,...,T), Viterbi algorithm have to calculate a probability of a word to take out Max a formula (3).…”
Section: Algorithm Analysismentioning
confidence: 99%
See 1 more Smart Citation
“…Analysing the base Viterbi algorithm, we have found that, one step t (t = 2,...,T), Viterbi algorithm have to calculate a probability of a word to take out Max a formula (3).…”
Section: Algorithm Analysismentioning
confidence: 99%
“…Among the above approaches, one based on the Hidden Markov model (HMM) can offer prominent results [3]. Especially, when using the Viterbi algorithm, it can achieve an accuracy rate of over 95 percent [4].…”
Section: Introductionmentioning
confidence: 99%
“…Speech signal is regarded to be short-time stationary [2][3][4][5][6] . Thus, we can use the modern signal process technology to deal with speech signal.…”
Section: Framing and Windowing Of Speech Signalmentioning
confidence: 99%
“…HMM algorithm used in speech recognition mainly started 30 years ago. There have been many research fruits on its application to speech recognition field since 1980 [3,4] . HMM algorithm is a probability model used to describe statistical properties of the stochastic processes, which is generally represented by parameters [4,5] .…”
Section: Introductionmentioning
confidence: 99%
See 1 more Smart Citation