Skip to main content
SpringerLink
Log in

Algorithmic Aspects of Speech Recognition: A Synopsis

  • Conference paper
  • First Online:
Combinatorial Pattern Matching (CPM 2000)

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

Included in the following conference series:

  • 583 Accesses

Abstract

Speech recognition is an area with a sizable literature, but there is little discussion of the topic within the computer science algorithms community. Since many of the problems arising in speech recognition are well suited for algorithmic studies, we present them in terms familiar to algorithm designers. Such cross fertilization can breed fresh insights from new perspectives.

This material is abstracted from A. L. Buchsbaum and R. Giancarlo, Algorithmic Aspects of Speech Recognition: An Introduction, ACM Journal of Experimental Algorithmics, Vol. 2, 1997, http://www.jea.acm.org.

Part of this work was done while the author was an MTS at AT&T Bell Labs and continued while visiting AT&T Labs. Part of the author’s research is supported by the Italian Ministry of Scientific Research, Project “Bioinformatica e Ricerca Genomica.”

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

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.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. L. R. Bahl, F. Jelinek, and R. L. Mercer. A maximum likelihood approach to continuous speech recognition. IEEE Transactions on Pattern Analysis and Machine Intelligence, PAMI-5:179–190, 1983.

    Article  Google Scholar 

  2. D. Breslauer. The suffix tree of a tree and minimizing sequential transducers. Theoretical Computer Science, 191(1-2):131–44, 1998.

    Article  MATH  MathSciNet  Google Scholar 

  3. A. L. Buchsbaum and R. Giancarlo. Algorithmic aspects in speech recognition: An introduction. ACM Journal of Experimental Algorithmics, 2, 1997. http://www.jea.acm.org.

  4. A. L. Buchsbaum, R. Giancarlo, and J. R. Westbrook. On the determinization of weighted automata. In Proc. 25th International Colloquium on Automata, Languages and Programming, volume 1443 of Lecture Notes in Computer Science, pages 482–93, 1998.

    Chapter  Google Scholar 

  5. A. L. Buchsbaum, R. Giancarlo, and J. R. Westbrook. Shrinking language models by robust approximation. In Proc. IEEE Int’l. Conf. on Acoustics, Speech, and Signal Processing’ 98, volume 2, pages 685–8, 1998. To appear in Algorithmica as “An Approximate Determinization Algorithm for Weighted Finite-State Automata”.

    Google Scholar 

  6. T. H. Cormen, C. E. Leiserson, and R. L. Rivest. Introduction to Algorithms. The MIT Electrical Engineering and Computer Science Series. MIT Press, Cambridge, MA, 1991.

    Google Scholar 

  7. H. N. Gabow. Scaling algorithms for network problems. Journal of Computer and System Sciences, 31:148–68, 1985.

    Article  MATH  MathSciNet  Google Scholar 

  8. P. E. Hart, N. J. Nilsson, and B. Raphael. A formal basis for the heuristic determination of minimum cost paths. IEEE Transactions on Systems, Science, and Cybernetics, 4:100–7, 1968.

    Article  Google Scholar 

  9. J. B. Kruskal and D. Sankoff, (editors). Time Wraps, String Edits, and Macromolecules: The Theory and Practice of Sequence Comparison. Addison-Wesley, 1983.

    Google Scholar 

  10. M. Mohri. Minimization of sequential transducers. In Proc. 5th Symposium on Combinatorial Pattern Matching, volume 807 of Lecture Notes in Computer Science, pages 151–63, 1994.

    Google Scholar 

  11. M. Mohri. Finite-state transducers in language and speech processing. Computational Linguistics, 29:269–311, 1997.

    MathSciNet  Google Scholar 

  12. M. Mohri, F. C. N. Pereira, and M. Riley. The design principles of a weighted finite-state transducer library. Theoretical Computer Science, 231:17–32, 2000.

    Article  MATH  MathSciNet  Google Scholar 

  13. A. Orda and R. Rom. Shortest path and minimum delay algorithms in networks with time-dependent edge-length. Journal of the ACM, 37:607–25, 1990.

    Article  MATH  MathSciNet  Google Scholar 

  14. F. Pereira and M. Riley. Speech recognition by composition of weighted finite automata. In Finite-State Language Processing. MIT Press, 1997.

    Google Scholar 

  15. F. Pereira, M. Riley, and R. Sproat. Weighted rational transductions and their application to human language processing. In Proc. ARPA Human Language Technology Conf., pages 249–54, 1994.

    Google Scholar 

  16. J. B. Pickering and B. S. Rosner. The Oxford Acoustic Phonetic Database on Compact Disk. Oxford University Press, 1993.

    Google Scholar 

  17. L. Rabiner and B.-H. Juang. Fundamentals of Speech Recognition. Prentice Hall Signal Processing Series. Prentice Hall, Englewood Cliffs, NJ, 1993.

    Google Scholar 

  18. C. Reutenauer and M.-P. Schützenberger. Minimization of rational word functions. SIAM Journal on Computing, 20(4):669–85, 1991.

    Article  MATH  MathSciNet  Google Scholar 

  19. E. Roche. Smaller representations for finite-state transducers and finite-state automata. In Proc. 6th Symposium on Combinatorial Pattern Matching, volume 937 of Lecture Notes in Computer Science, pages 352–65, 1995.

    Google Scholar 

  20. A. J. Viterbi. Error bounds for convolutional codes and an asymptotically optimal decoding algorithm. IEEE Transactions on Information Theory, IT-13:260–9, 1967.

    Article  Google Scholar 

  21. A. Waibel and K.-F. Lee, (editors). Readings in Speech Recognition. Morgan Kaufmann, 1990.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. AT&T Labs, Shannon Laboratory, 180 Park Ave, Florham Park, NJ, 07932, USA

    Adam L. Buchsbaum

  2. Dipartimento di Matematica ed Applicazioni, Universitá di Palermo, Via Archirafi 34, 90123, Palermo, Italy

    Raffaele Giancarlo

Authors
  1. Adam L. Buchsbaum
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Raffaele Giancarlo
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Dipartimento di Matematica ed Applicazioni, Universitá die Palermo, Via Archirafi 34, 90123, Palermo, Italy

    Raffaele Giancarlo

  2. Centre de recherches mathématiques, Université de Montréal, CP 6128, succursale Centre-Ville, Montréal, Québec, Canada, H3C 3J7

    David Sankoff

Rights and permissions

Reprints and permissions

Copyright information

© 2000 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Buchsbaum, A.L., Giancarlo, R. (2000). Algorithmic Aspects of Speech Recognition: A Synopsis. In: Giancarlo, R., Sankoff, D. (eds) Combinatorial Pattern Matching. CPM 2000. Lecture Notes in Computer Science, vol 1848. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45123-4_4

Download citation

  • DOI: https://doi.org/10.1007/3-540-45123-4_4

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-67633-1

  • Online ISBN: 978-3-540-45123-5

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation