메뉴 건너뛰기




Volumn , Issue , 2001, Pages 214-217

A one-pass decoder based on polymorphic linguistic context assignment

Author keywords

[No Author keywords available]

Indexed keywords

CONTEXT FREE GRAMMARS; CONTEXT FREE LANGUAGES; DECODING; INFORMATION USE; LINGUISTICS; VOCABULARY CONTROL;

EID: 84962868641     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ASRU.2001.1034625     Document Type: Conference Paper
Times cited : (142)

References (12)
  • 1
    • 0029725454 scopus 로고    scopus 로고
    • Improvements of the pronunciation prefix tree search organization
    • Atlanta, USA
    • F. Alleva, X. Huang, and M.-Y. Hwang. Improvements of the pronunciation prefix tree search organization. In Proceedings of the ICASSP, Atlanta, USA, 1996.
    • (1996) Proceedings of the ICASSP
    • Alleva, F.1    Huang, X.2    Hwang, M.-Y.3
  • 3
    • 85009118347 scopus 로고    scopus 로고
    • One pass cross word decoding for large vocabularies based on a lexical tree search organization
    • Budapest, Hungary
    • X. Aubert. One pass cross word decoding for large vocabularies based on a lexical tree search organization. In Proceedings of the Eurospeech, Budapest, Hungary, 1999.
    • (1999) Proceedings of the Eurospeech
    • Aubert, X.1
  • 5
    • 80053229524 scopus 로고    scopus 로고
    • Modeling and efficient decoding of large vocabulary conversational speech
    • Budapest, Hungary
    • M. Finke, D. Koll, J. Fritsch, and A. Waibel. Modeling and efficient decoding of large vocabulary conversational speech. In Proceedings of the Eurospeech, Budapest, Hungary, 1999.
    • (1999) Proceedings of the Eurospeech
    • Finke, M.1    Koll, D.2    Fritsch, J.3    Waibel, A.4
  • 6
    • 0029725761 scopus 로고    scopus 로고
    • The bucket box intersection (BBI) algorithm for fast approximative evaluation of diagonal mixture gaussians
    • Atlanta, USA
    • J. Fritsch and I. Rogina. The bucket box intersection (BBI) algorithm for fast approximative evaluation of diagonal mixture gaussians. In Proceedings of the ICASSP, Atlanta, USA, 1996.
    • (1996) Proceedings of the ICASSP
    • Fritsch, J.1    Rogina, I.2
  • 7
    • 85017308347 scopus 로고
    • Improvements in beam search for 10000-word continuous speech recognition
    • San Francisco, USA
    • H. Ney, R. Haeb-Umbach, B.-H. Tran, and M. Oerder. Improvements in beam search for 10000-word continuous speech recognition. In Proceedings of the ICASSP, San Francisco, USA, 1992.
    • (1992) Proceedings of the ICASSP
    • Ney, H.1    Haeb-Umbach, R.2    Tran, B.-H.3    Oerder, M.4
  • 9
    • 84892179479 scopus 로고    scopus 로고
    • Improved lexical tree search for large vocabulary speech recognition
    • Seattle, USA
    • S. Ortmanns, A. Eiden, and H. Ney. Improved lexical tree search for large vocabulary speech recognition. In Proceedings of the ICASSP, Seattle, USA, 1998.
    • (1998) Proceedings of the ICASSP
    • Ortmanns, S.1    Eiden, A.2    Ney, H.3
  • 12
    • 0029770143 scopus 로고    scopus 로고
    • Minimizing search errors due to delayed bigrams in real-time speech recognition systems
    • Atlanta, USA
    • M. Woszcyna and M. Finke. Minimizing search errors due to delayed bigrams in real-time speech recognition systems. In Proceedings of the ICASSP, Atlanta, USA, 1996.
    • (1996) Proceedings of the ICASSP
    • Woszcyna, M.1    Finke, M.2


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