메뉴 건너뛰기




Volumn 8, Issue 6, 2000, Pages 676-686

The time-conditioned approach in dynamic programming search for LVCSR

Author keywords

Beam search; Dynamic programming; Large vocabulary speech recognition; One pass dp search; Search organization; Time conditioned dp search

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; DECISION THEORY; DECODING; DYNAMIC PROGRAMMING; GRAPH THEORY; MARKOV PROCESSES; MATHEMATICAL MODELS; PROBABILITY; SPEECH CODING; VECTORS;

EID: 0034321517     PISSN: 10636676     EISSN: None     Source Type: Journal    
DOI: 10.1109/89.876301     Document Type: Article
Times cited : (10)

References (28)
  • 2
    • 0020719320 scopus 로고
    • A maximum likelihood approach to continuous speech recognition,"
    • Mar.
    • L. R. Bahl, F. Jelinek, and R. L. Mercer, "A maximum likelihood approach to continuous speech recognition," IEEE Trans. Pattern Anal. Machine Intel!., vol. PAMI-5, pp. 179-190, Mar. 1983.
    • (1983) IEEE Trans. Pattern Anal. Machine Intel!. , vol.PAMI-5 , pp. 179-190
    • Bahl, L.R.1    Jelinek, F.2    Mercer, R.L.3
  • 3
    • 0016615529 scopus 로고
    • Decoding for channels with insertions, deletions and substitutions with applications to speech recognition
    • July
    • L. R. Bahl and F. Jelinek, "Decoding for channels with insertions, deletions and substitutions with applications to speech recognition," IEEE Trans. Inform. Theory, vol. IT-21, pp. 404-411, July 1975.
    • (1975) IEEE Trans. Inform. Theory , vol.IT-21 , pp. 404-411
    • Bahl, L.R.1    Jelinek, F.2
  • 4
    • 0040856612 scopus 로고
    • Stochastic modeling for automatic speech understanding
    • D. R. Reddy, Ed. New York: Academic
    • J. K. Baker, "Stochastic modeling for automatic speech understanding," in Speech Recognition, D. R. Reddy, Ed. New York: Academic, 1975, pp. 512-542.
    • (1975) Speech Recognition , pp. 512-542
    • Baker, J.K.1
  • 6
    • 0027297381 scopus 로고
    • Vector quantization for the dfficient computation of continuous density likelihoods," in
    • Minneapolis, MN, Apr.
    • E. Bocchieri, "Vector quantization for the dfficient computation of continuous density likelihoods," in Proc. IEEE Int. Conf. Acoustics, Speech, Signal Processing, Minneapolis, MN, Apr. 1993, pp. 692-695.
    • (1993) Proc. IEEE Int. Conf. Acoustics, Speech, Signal Processing , pp. 692-695
    • Bocchieri, E.1
  • 9
    • 0028420015 scopus 로고
    • Improvements in time-synchronous beam search for 10000-word continuous speech recognition
    • Apr.
    • R. Haeb-Umbach and H. Ney, "Improvements in time-synchronous beam search for 10000-word continuous speech recognition," IEEE Trans. Speech Audio Processing, vol. 2, pp. 353-356, Apr. 1994.
    • (1994) IEEE Trans. Speech Audio Processing , vol.2 , pp. 353-356
    • Haeb-Umbach, R.1    Ney, H.2
  • 11
    • 0003295404 scopus 로고
    • The HARPY speech understanding system
    • W. A. Lea, Ed. Englewood Cliffs, NJ: Prentice-Hall
    • B. T. Lowerre and R. Reddy, 'The HARPY speech understanding system," in Trends in Speech Recognition, W. A. Lea, Ed. Englewood Cliffs, NJ: Prentice-Hall, 1980, pp. 340-360.
    • (1980) Trends in Speech Recognition , pp. 340-360
    • Lowerre, B.T.1    Reddy, R.2
  • 12
    • 85017308347 scopus 로고
    • Improvements in beam search for 10000-word continuous speech recognition
    • San Francisco, CA, Mar.
    • H. Ney, R. Haeb-Umbach, B.-H.Tran, and M. Oerder, "Improvements in beam search for 10000-word continuous speech recognition," in Proc. IEEE Int. Conf. Acoustics, Speech, Signal Processing, San Francisco, CA, Mar. 1992, pp. 13-16.
    • (1992) Proc. IEEE Int. Conf. Acoustics, Speech, Signal Processing , pp. 13-16
    • Ney, H.1    Haeb-Umbach, R.2
  • 13
    • 0026818496 scopus 로고
    • Data driven organization of the dynamic programming beam search for continuous speech recognition
    • Feb.
    • H. Ney, D. Mergel, A. Noll, and A. Paeseler, "Data driven organization of the dynamic programming beam search for continuous speech recognition," IEEE Trans. Signal Processing, vol. 40, pp. 272-281, Feb. 1992.
    • (1992) IEEE Trans. Signal Processing , vol.40 , pp. 272-281
    • Ney, H.1    Mergel, D.2    Noll, A.3    Paeseler, A.4
  • 14
    • 0030695742 scopus 로고    scopus 로고
    • Extensions to the word graph method for large vocabulary continuous speech recognition
    • Apr.
    • H. Ney and S. Ortmanns, "Extensions to the word graph method for large vocabulary continuous speech recognition," Proc. IEEE Int. Conf. Acoustics, Speech, Signal Processing, vol. 3, pp. 1787-1790, Apr. 1997.
    • (1997) Proc. IEEE Int. Conf. Acoustics, Speech, Signal Processing , vol.3 , pp. 1787-1790
    • Ney, H.1    Ortmanns, S.2
  • 16
    • 0027189233 scopus 로고
    • Word graphs: An efficient interface between continuous speech recognition and language understanding
    • Minneapolis, MN, Apr.
    • M. Oerder and H. Ney, "Word graphs: An efficient interface between continuous speech recognition and language understanding," in Proc. IEEE Int. Conf. Acoustics, Speech, Signal Processing, vol. 2, Minneapolis, MN, Apr. 1993, pp. 119-122.
    • (1993) Proc. IEEE Int. Conf. Acoustics, Speech, Signal Processing , vol.2 , pp. 119-122
    • Oerder, M.1    Ney, H.2
  • 17
    • 0030375302 scopus 로고    scopus 로고
    • A comparison of time conditioned and word conditioned search techniques for large vocabulary speech recognition
    • Philadelphia, PA, Oct.
    • S. Ortmanns, H. Ney, F. Seide, and I. Lindam, "A comparison of time conditioned and word conditioned search techniques for large vocabulary speech recognition," in Proc. IEEE Int. Conf. Spoken Language Processing, Philadelphia, PA, Oct. 1996, pp. 2091-2094.
    • (1996) Proc. IEEE Int. Conf. Spoken Language Processing , pp. 2091-2094
    • Ortmanns, S.1    Ney, H.2    Seide, F.3    Lindam, I.4
  • 19
    • 0030719155 scopus 로고    scopus 로고
    • A word graph algorithm for large vocabulary continuous speech recognition
    • Jan.
    • S. Ortmanns, H. Ney, and X. Aubert, "A word graph algorithm for large vocabulary continuous speech recognition," Computer, Speech, Language, vol. 11, pp. 43-72, Jan. 1997.
    • (1997) Computer, Speech, Language , vol.11 , pp. 43-72
    • Ortmanns, S.1    Ney, H.2    Aubert, X.3
  • 20
    • 85135169713 scopus 로고    scopus 로고
    • Fast likelihood computation methods for continuous mixture densities in large vocabulary speech recognition
    • Rhodes, Greece, Sept.
    • S. Ortmanns, H. Ney, and T. Firzlaff, "Fast likelihood computation methods for continuous mixture densities in large vocabulary speech recognition," in Proc. 5th Eur. Conf. Speech Communication Technology, Rhodes, Greece, Sept. 1997, pp. 143-146.
    • (1997) Proc. 5th Eur. Conf. Speech Communication Technology , pp. 143-146
    • Ortmanns, S.1    Ney, H.2    Firzlaff, T.3
  • 21
    • 0026368475 scopus 로고
    • Algorithms for an optimal A" search and linearizing the search in the stack decoder
    • Toronto, ON, Canada, May
    • D. B. Paul, "Algorithms for an optimal A" search and linearizing the search in the stack decoder," in Proc. IEEE Int. Conf. Acoustics, Speech, Signal Processing, Toronto, ON, Canada, May 1991, pp. 693-996.
    • (1991) Proc. IEEE Int. Conf. Acoustics, Speech, Signal Processing , pp. 693-996
    • Paul, D.B.1
  • 22
    • 85017287102 scopus 로고
    • An efficient A' stack decoder algorithm for continuous speech recognition with a stochastic language model
    • San Francisco, CA, Mar.
    • "An efficient A' stack decoder algorithm for continuous speech recognition with a stochastic language model," in Proc. IEEE Int. Conf. Acoustics, Speech, Signal Processing, San Francisco, CA, Mar. 1992, pp. 25-28.
    • (1992) Proc. IEEE Int. Conf. Acoustics, Speech, Signal Processing , pp. 25-28
  • 24
    • 0029725455 scopus 로고    scopus 로고
    • Efficient dvaluation of the LVCSR search space using the NOWAY decoder
    • Atlanta, GA, May
    • "Efficient dvaluation of the LVCSR search space using the NOWAY decoder," in Proc. IEEE Int. Conf. Acoustics, Speech, Signal Processing, Atlanta, GA, May 1996, pp. 149-152.
    • (1996) Proc. IEEE Int. Conf. Acoustics, Speech, Signal Processing , pp. 149-152
  • 25
    • 0018724280 scopus 로고
    • Two-level DP matching-A dynamic programming-based pattern matching algorithm for connected word recognition
    • Dec.
    • H. Sakoe, 'Two-level DP matching-A dynamic programming-based pattern matching algorithm for connected word recognition," IEEE Trans. Acoust., Speech, Signal Processing, vol. ASSP-27, pp. 588-595, Dec. 1979.
    • (1979) IEEE Trans. Acoust., Speech, Signal Processing , vol.ASSP-27 , pp. 588-595
    • Sakoe, H.1
  • 26
    • 0026390882 scopus 로고
    • A comparison of several approximate algorithms for finding multiple (N-best) sentence hypotheses
    • Toronto, ON, Canada, May
    • R. Schwartz and S. Austin, "A comparison of several approximate algorithms for finding multiple (N-best) sentence hypotheses," in Proc. IEEE Int. Conf. Acoustics, Speech, Signal Processing, Toronto, ON, Canada, May 1991, pp. 701-704.
    • (1991) Proc. IEEE Int. Conf. Acoustics, Speech, Signal Processing , pp. 701-704
    • Schwartz, R.1    Austin, S.2


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.