By Topic

State reduction in hidden Markov chains used for speech recognition

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

1 Author(s)
Kamp, Y. ; Philips Research Laboratory, Brussels, Belgium

This paper examines the problem of reducing the number of states in the Markov chain models used in speech recognition algorithms by statistical methods. It is shown that the equivalence requirements between the original and reduced model lead to entirely different reduction equations depending on whether the reduction occurs inside a word model or between the models of different words. In general, the exact solution of these reduction equations is not possible and one shows that a least-squares solution can be reformulated as a matrix approximation problem in Euclidean norm.

Published in:

Acoustics, Speech and Signal Processing, IEEE Transactions on  (Volume:33 ,  Issue: 5 )