Efficient backward decoding of high-order hidden Markov models

DOI10.1016/j.patcog.2009.06.004zbMath1176.68179OpenAlexW2002416697MaRDI QIDQ733144

H. A. Engelbrecht, Johan A. du Preez

Publication date: 15 October 2009

Published in: Pattern Recognition (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.patcog.2009.06.004

zbMATH Keywords

hidden Markov modeldecodingspeech recognitionsearchhigh-order

Mathematics Subject Classification ID

Pattern recognition, speech recognition (68T10) Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science) (68P30) Natural language processing (68T50)

Related Items

A novel method for decoding any high-order hidden Markov model ⋮ A hidden Markov model with dependence jumps for predictive modeling of multidimensional time-series

Cites Work

• Unnamed Item
• High-order extensions of the Double Chain Markov Model
• The double chain markov model
• Statistical Inference for Probabilistic Functions of Finite State Markov Chains
• Error bounds for convolutional codes and an asymptotically optimum decoding algorithm
• An inequality with applications to statistical estimation for probabilistic functions of Markov processes and to a model for ecology
• A Maximization Technique Occurring in the Statistical Analysis of Probabilistic Functions of Markov Chains