By Topic

Application of Markov chains to 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 $31
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

3 Author(s)
Dai, J. ; Sch. of Comput. & Math. Sci., Robert Gordon Inst. of Technol., Aberdeen, UK ; Tyler, J.E. ; MacKenzie, I.G.

The authors describe how discrete Markov chains may be applied to speech recognition. In this application, a spectral vector is modelled by a state of a Markov chain, and an utterance is viewed as a sequence of observed states. Experiment showed that a speech recogniser based on this Markov model not only outperforms the HMM recognisers tested for comparison but also offers a saving in computation time.

Published in:

Electronics Letters  (Volume:27 ,  Issue: 25 )