메뉴 건너뛰기




Volumn E86-D, Issue 6, 2003, Pages 1059-1067

Improved Phoneme-History-Dependent Search Method for Large-Vocabulary Continuous-Speech Recognition

Author keywords

Multi pass search; Phoneme history dependent search; Search algorithm; Speech recognition; Word graph

Indexed keywords

ALGORITHMS; DECODING; SERVERS;

EID: 0142007749     PISSN: 09168532     EISSN: None     Source Type: Journal    
DOI: None     Document Type: Article
Times cited : (9)

References (12)
  • 2
    • 0038000234 scopus 로고    scopus 로고
    • Conversational interfaces: Advances and challenges
    • Aug.
    • V.W. Zue and J.R. Glass, "Conversational interfaces: Advances and challenges," Proc. IEEE, vol.88, no.8, pp.1166-1180, Aug. 2000.
    • (2000) Proc. IEEE , vol.88 , Issue.8 , pp. 1166-1180
    • Zue, V.W.1    Glass, J.R.2
  • 3
    • 0009588470 scopus 로고    scopus 로고
    • Progressive 2-pass decoder for real-time broadcast news captioning
    • T. Imai, A. Kobayashi, S. Sato, H. Tanaka, and A. Ando, "Progressive 2-pass decoder for real-time broadcast news captioning," ICSLP'2000, pp.246-249, 2000.
    • (2000) ICSLP'2000 , pp. 246-249
    • Imai, T.1    Kobayashi, A.2    Sato, S.3    Tanaka, H.4    Ando, A.5
  • 5
    • 85009108017 scopus 로고    scopus 로고
    • Novel two-pass search strategy using time-asynchronous shortest-first second-pass beam search
    • A. Ogawa, Y. Noda, and S. Matsunaga, "Novel two-pass search strategy using time-asynchronous shortest-first second-pass beam search," ICSLP'2000, pp.290-293, 2000.
    • (2000) ICSLP'2000 , pp. 290-293
    • Ogawa, A.1    Noda, Y.2    Matsunaga, S.3
  • 6
    • 0026390882 scopus 로고
    • A comparison of several approximate algorithms for finding multiple (N-BEST) sentence hypotheses
    • R. Schwartz and S. Austin, "A comparison of several approximate algorithms for finding multiple (N-BEST) sentence hypotheses," ICASSP'91, pp.701-704, 1991.
    • (1991) ICASSP'91 , pp. 701-704
    • Schwartz, R.1    Austin, S.2
  • 7
    • 0030719155 scopus 로고    scopus 로고
    • A word graph algorithm for large vocabulary continuous speech recognition
    • S. Ortmanns, H. Ney, and X. Aubert, "A word graph algorithm for large vocabulary continuous speech recognition," Computer Speech and Language, vol.11, pp.43-72, 1996.
    • (1996) Computer Speech and Language , vol.11 , pp. 43-72
    • Ortmanns, S.1    Ney, H.2    Aubert, X.3
  • 8
    • 0029765807 scopus 로고    scopus 로고
    • Spontaneous dialogue speech recognition using cross-word context constrained word graphs
    • T. Shimizu, H. Yamamoto, H. Masataki, S. Matsunaga, and Y. Sagisaka, "Spontaneous dialogue speech recognition using cross-word context constrained word graphs," ICASSP'96, pp.145-148, 1996.
    • (1996) ICASSP'96 , pp. 145-148
    • Shimizu, T.1    Yamamoto, H.2    Masataki, H.3    Matsunaga, S.4    Sagisaka, Y.5
  • 9
    • 4243730512 scopus 로고    scopus 로고
    • An approximation technique in large-vocabulary continuous speech recognition using a word graph
    • Y. Noda, S. Matsunaga, and S. Sagayama, "An approximation technique in large-vocabulary continuous speech recognition using a word graph," IEICE Technical Report, SP96-102, 1997.
    • (1997) IEICE Technical Report , vol.SP96-102
    • Noda, Y.1    Matsunaga, S.2    Sagayama, S.3
  • 10
    • 0029770143 scopus 로고    scopus 로고
    • Minimizing search errors due to delayed bigrams in real-time speech recognition systems
    • M. Woszczyna and M. Finke, "Minimizing search errors due to delayed bigrams in real-time speech recognition systems," ICASSP'96, pp.137-140, 1996.
    • (1996) ICASSP'96 , pp. 137-140
    • Woszczyna, M.1    Finke, M.2
  • 11
    • 85128392820 scopus 로고    scopus 로고
    • The BBN single-phonetic-tree fast-match algorithm
    • L. Nguyen and R. Schwartz, "The BBN single-phonetic-tree fast-match algorithm," ICSLP'98, pp.1827-1830, 1998.
    • (1998) ICSLP'98 , pp. 1827-1830
    • Nguyen, L.1    Schwartz, R.2


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