메뉴 건너뛰기




Volumn 21, Issue 1, 2007, Pages 1-25

A fast and memory-efficient N-gram language model lookup method for large vocabulary continuous speech recognition

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATION TIME; DECODING TIME; LARGE VOCABULARY CONTINUOUS SPEECH RECOGNITION (LVCSR); ORDER PRESERVING LM CONTEXT PRE COMPUTING (OPCP);

EID: 33749555597     PISSN: 08852308     EISSN: 10958363     Source Type: Journal    
DOI: 10.1016/j.csl.2005.11.002     Document Type: Article
Times cited : (8)

References (28)
  • 1
    • 0030635307 scopus 로고    scopus 로고
    • Alleva, F., 1997. Search organization in the Whisper continuous speech recognition system. In: Proceedings of IEEE Workshop on Automatic Speech Recognition and Understanding, pp. 295-302.
  • 2
    • 0029725454 scopus 로고    scopus 로고
    • Alleva, F., Huang, X., Hwang, M.-Y., 1996. Improvements on the pronunciation prefix tree search organization. In: Proceedings of ICASSP, Atlanta, GA, USA, vol. 1, pp. 133-136.
  • 3
    • 33749558112 scopus 로고    scopus 로고
    • Aubert, X., 1999. One pass cross word decoding for large vocabularies based on a lexical tree search organization. In: Proceedings of Eurospeech, Budapest, Hungary, vol. 4, pp. 1559-1562.
  • 5
    • 4544242764 scopus 로고    scopus 로고
    • Cardenal-Lopez, A., Dieguez-Tirado, P., Garcia-Mateo, C., 2002. Fast LM look-ahead for large vocabulary continuous speech recognition using perfect hashing. In: Proceedings of ICASSP, Orlando, FL, USA, pp. I-705-I-708.
  • 6
    • 0027112822 scopus 로고
    • An optimal algorithm for generating minimal perfect hash functions
    • Czech Z., Havas G., and Majewski B. An optimal algorithm for generating minimal perfect hash functions. Information Processing Letters 43 5 (1992) 257-264
    • (1992) Information Processing Letters , vol.43 , Issue.5 , pp. 257-264
    • Czech, Z.1    Havas, G.2    Majewski, B.3
  • 7
    • 85032751683 scopus 로고    scopus 로고
    • Hierarchical search for large-vocabulary conversational speech recognition: working towards a solution to the decoding problem
    • Deshmukh N., Ganapathiraju A., and Picone J. Hierarchical search for large-vocabulary conversational speech recognition: working towards a solution to the decoding problem. IEEE Signal Processing Magazine 16 5 (1999) 84-107
    • (1999) IEEE Signal Processing Magazine , vol.16 , Issue.5 , pp. 84-107
    • Deshmukh, N.1    Ganapathiraju, A.2    Picone, J.3
  • 8
    • 84976812946 scopus 로고
    • Practical minimal perfect hash functions for large databases
    • Fox E., Heath L., Chen Q., and Daoud A. Practical minimal perfect hash functions for large databases. Communications of the ACM 35 1 (1992) 105-121
    • (1992) Communications of the ACM , vol.35 , Issue.1 , pp. 105-121
    • Fox, E.1    Heath, L.2    Chen, Q.3    Daoud, A.4
  • 10
    • 33749573170 scopus 로고    scopus 로고
    • Jenkins, R., 1995. Hash Functions for Hash Table Lookup. Available from: .
  • 11
    • 85009216639 scopus 로고    scopus 로고
    • Li, X., Zhao, Y., 2003. Exploiting order-preserving minimum perfect hashing to speedup N-gram language model look-ahead. In: Proceedings of Eurospeech, Geneva, Switzerland, pp. 2281-2284.
  • 12
    • 33749580967 scopus 로고    scopus 로고
    • Martin A., Przybocki, M., 2001. The 2001 NIST evaluation for recognition of conversational speech over the telephone. In: Proceedings of NIST Large Vocabulary Conversational Speech Recognition Workshop, MD, USA. Available from: .
  • 13
    • 85032751521 scopus 로고    scopus 로고
    • Dynamic programming search for continuous speech recognition
    • Ney H., and Ortmanns S. Dynamic programming search for continuous speech recognition. IEEE Signal Processing Magazine 16 5 (1999) 64-83
    • (1999) IEEE Signal Processing Magazine , vol.16 , Issue.5 , pp. 64-83
    • Ney, H.1    Ortmanns, S.2
  • 14
    • 0000673699 scopus 로고    scopus 로고
    • Ney, H., Welling, L., Ortmanns, S., Beulen, K., Wessel, F., 1998. RWTH large vocabulary continuous speech recognition system. In: Proceedings of ICASSP, Seattle, USA, vol. 2, pp. 853-856.
  • 15
    • 84892179479 scopus 로고    scopus 로고
    • Ortmanns, S., Eiden, A., Ney, H., 1998. Improved lexical tree search for large vocabulary speech recognition. In: Proceedings of ICASSP, Seattle, WA, USA, vol. 2, pp. 817-820.
  • 16
    • 0030676561 scopus 로고    scopus 로고
    • Ortmanns, S., Eiden, A., Ney, H., Coenen, N., 1997. Look-ahead techniques for fast beam search. In: Proceedings of ICASSP, Munich, Germany, pp. 1783-1786.
  • 17
    • 0030366694 scopus 로고    scopus 로고
    • Ortmanns, S., Ney, H., Eiden, A., 1996. Language-model look-ahead for large vocabulary speech recognition. In: Proceedings of ICSLP, Philadelphia, PA, USA, vol. 4, pp. 2095-2098.
  • 18
    • 33749565766 scopus 로고    scopus 로고
    • Sixtus, A., 2003. Across-word phoneme models for large vocabulary continuous speech recognition. Ph.D. dissertation, RWTH, Germany.
  • 19
    • 0036556171 scopus 로고    scopus 로고
    • From within-word model search to across-word model search in large vocabulary continuous speech recognition
    • Sixtus A., and Ney H. From within-word model search to across-word model search in large vocabulary continuous speech recognition. Computer Speech & Language 16 2 (2002) 245-271
    • (2002) Computer Speech & Language , vol.16 , Issue.2 , pp. 245-271
    • Sixtus, A.1    Ney, H.2
  • 20
    • 0036296954 scopus 로고    scopus 로고
    • Soltau, H., Metze, F., Fugen, C., Waibel, A., 2002. Efficient language model lookahead through polymorphic linguistic context assignment. In: Proceedings of ICASSP, Orlando, FL, USA, vol. 1, pp. I-709-I-712.
  • 21
    • 84891308106 scopus 로고    scopus 로고
    • Stolcke, A., 2002. SRILM - An extensible language modeling toolkit. In: Proceedings of International Conference on Spoken Language Processing, Denver, CO, USA, vol. 2, pp. 901-904.
  • 22
    • 33749564276 scopus 로고    scopus 로고
    • Stolcke, A., Bratt, H., Butzberger, J., Franco, H., Gadde, V., Plauche, M., Richey, C., Shriberg, E., Sonmez, K., Weng, F., Zheng, J., 2000. The SRI March 2000 Hub-5 conversational speech transcription system. In: Proceedings of NIST Speech Transcription Workshop, College Park, MD, USA. Available from: .
  • 23
    • 33749564057 scopus 로고    scopus 로고
    • Sundaram, R., Hamaker, J., Picone, J., 2001. Twister: the ISIP 2001 conversational speech evaluation system. In: Proceedings of NIST Large Vocabulary Conversational Speech Recognition Workshop, Linthicum Heights, MD, USA. Available from: .
  • 24
    • 33749562326 scopus 로고    scopus 로고
    • Tarjan, R., 1983. Data Structures and Network Algorithms. SIAM Monograph #44.
  • 25
    • 33749554154 scopus 로고    scopus 로고
    • Woodland, P., Evermann, G., Gales, M., Hain, T., Liu, A., Moore, G., Povey, D., Wang, L., 2002. CU-HTK April 2002 Switchboard System. In: Proceedings of NIST Rich Transcription Workshop, Vienna, VA, USA. Available from: .
  • 27
    • 33749580006 scopus 로고    scopus 로고
    • Young, S., Russel, R., Thornton, J., 1989. Token passing: A simple conceptual model for connected speech recognition systems. Technical Report, Cambridge University Engineering Department.
  • 28
    • 85009250288 scopus 로고    scopus 로고
    • Zhang, X., Zhao Y., 2002. Minimum perfect hashing for fast N-gram language model lookup. In: Proceedings of ICSLP, Denver, CO, USA, vol. 1, pp. 401-404.


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