By Topic

A parallel implementation of a hidden Markov model with duration modeling 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

4 Author(s)
Mitchell, C.D. ; Sch. of Electr. Eng., Purdue Univ., W. Lafayette, IN, USA ; Helzerman, R.A. ; Jamieson, L.H. ; Harper, Mary P.

This paper describes a parallel implementation of a Hidden Markov Model (HMM) for spoken language recognition on the MasPar MP-1. By exploiting the massive parallelism of explicit duration HMMs, we can develop more complex models for real-time speech recognition. Implementational issues such as choice of data structures, method of communication, and utilization of parallel functions are explored. The results of our experiments show that the parallelism in HMMs can be effectively exploited by the MP-1. Training that use to take nearly a week can now be completed in about an hour. The system can recognize the phones of a test utterance in a fraction of a second

Published in:

Parallel and Distributed Processing, 1993. Proceedings of the Fifth IEEE Symposium on

Date of Conference:

1-4 Dec 1993