Advertisement

Algorithmic Aspects of Speech Recognition: A Synopsis

  • Adam L. Buchsbaum
  • Raffaele Giancarlo
Conference paper
  • 407 Downloads
Part of the Lecture Notes in Computer Science book series (LNCS, volume 1848)

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.

Keywords

Speech Recognition Input String Speech Corpus Algorithmic Aspect Weighted Automaton 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 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.CrossRefGoogle Scholar
  2. 2.
    D. Breslauer. The suffix tree of a tree and minimizing sequential transducers. Theoretical Computer Science, 191(1-2):131–44, 1998.zbMATHCrossRefMathSciNetGoogle Scholar
  3. 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. 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.CrossRefGoogle Scholar
  5. 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. 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. 7.
    H. N. Gabow. Scaling algorithms for network problems. Journal of Computer and System Sciences, 31:148–68, 1985.zbMATHCrossRefMathSciNetGoogle Scholar
  8. 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.CrossRefGoogle Scholar
  9. 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. 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. 11.
    M. Mohri. Finite-state transducers in language and speech processing. Computational Linguistics, 29:269–311, 1997.MathSciNetGoogle Scholar
  12. 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.zbMATHCrossRefMathSciNetGoogle Scholar
  13. 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.zbMATHCrossRefMathSciNetGoogle Scholar
  14. 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. 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. 16.
    J. B. Pickering and B. S. Rosner. The Oxford Acoustic Phonetic Database on Compact Disk. Oxford University Press, 1993.Google Scholar
  17. 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. 18.
    C. Reutenauer and M.-P. Schützenberger. Minimization of rational word functions. SIAM Journal on Computing, 20(4):669–85, 1991.zbMATHCrossRefMathSciNetGoogle Scholar
  19. 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. 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.CrossRefGoogle Scholar
  21. 21.
    A. Waibel and K.-F. Lee, (editors). Readings in Speech Recognition. Morgan Kaufmann, 1990.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2000

Authors and Affiliations

  • Adam L. Buchsbaum
    • 1
  • Raffaele Giancarlo
    • 2
  1. 1.AT&T Labs, Shannon LaboratoryFlorham ParkUSA
  2. 2.Dipartimento di Matematica ed ApplicazioniUniversitá di PalermoPalermoItaly

Personalised recommendations