Skip to main content

Study of Parallelization of the Training for Automatic Speech Recognition

  • Conference paper
  • First Online:
High Performance Computing and Networking (HPCN-Europe 2000)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 1823))

Included in the following conference series:

Abstract

In this work we study the parallelization of the training phase for an automatic speech recognition system using the Hidden Markov Models. The vocabulary is uniformly distributed on processors, but the Markovian network of the treated application is duplicated on all processors. The proposed parallel algorithms are based on two strategies of communications. In the first one, called regrouping algorithm, communications are delayed until the training of all local sentences is finished. In the second one, called cutting algorithm, packages of optimal sizes is firstly determined and then asynchronous communications are performed after the training of each package. Experimental results show that good performances can be obtained with the second algorithm.

Supported by the European Program INCO-DC, “DAPPI” Project

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. E.M. Daoudi, A. Meziane, Y.O. MOhamed El Hadj, “Parallel HMM Model for Automatic Speech recognition”, RR-Lari, Oujda, 1999, Submitted for publication.

    Google Scholar 

  2. M. Fleury, A. C. Downton, A. F. Clark, “Parallel Structure in an Integrated Speech-Recognition Network”, In Proceedings of Euro-Par’99, pages 995–1004, 1999.

    Google Scholar 

  3. D. R. Forney, “The Viterbi Algorithm”, Proc IEEE, Vol 61, n o3, Mai 1973.

    Google Scholar 

  4. H. Noda, M. N. Shirazi, “A MRF-based parallel processing algorithm for speech recognition using linear predictive HMM”, ICASSP’ 94, pages I-597–I-600, 1994.

    Google Scholar 

  5. S. Phillips, A. Rogers, “Parallel Speech Recognition”, EUROSPEECH-97.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2000 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

El Daoudi, M., Meziane, A., El Hadj, Y.O.M. (2000). Study of Parallelization of the Training for Automatic Speech Recognition. In: Bubak, M., Afsarmanesh, H., Hertzberger, B., Williams, R. (eds) High Performance Computing and Networking. HPCN-Europe 2000. Lecture Notes in Computer Science, vol 1823. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45492-6_66

Download citation

  • DOI: https://doi.org/10.1007/3-540-45492-6_66

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-67553-2

  • Online ISBN: 978-3-540-45492-2

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics