AN EFFICIENT TWO-PASS SEARCH ALGORITHM USING WORD TRELLIS INDEX

5th International Conference on Spoken Language Processing, ICSLP 1998

Volumn , Issue , 1998, Pages

  Lee, Akinobu ^a   Kawahara, Tatsuya ^a   Doshita, Shuji ^a  

^a KYOTO UNIVERSITY   (Japan)

Author keywords

[No Author keywords available]

Indexed keywords

HIDDEN MARKOV MODELS; SPEECH RECOGNITION; TRELLIS CODES;

GRAPH METHODS; HIGH-ACCURACY; MEMORY COST; PAIR APPROXIMATION; SEARCH ALGORITHMS; STACK DECODING; TIME FRAME; WORD GRAPHS; WORD LISTS; WORD-PAIRS;

LEARNING ALGORITHMS;

EID: 85128340946     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (7)

1. H. Ney and X. Aubert: A Word Graph Algorithm for Large Vocabulary Continuous Speech Recognition, Proc. ICSLP, pp1355-1358 (1994).
2. F.K.Soong and Eng-Fong Huang: A Tree-Trellis Based Fast Search for Finding the N-Best Sentence Hypotheses in Continuous Speech Recognition, Proc. IEEE-ICASSP, pp705-708 (1991).
3. J.J.Odel, V.Valtchev, P.C.Woodland and S.J.Young: A One Pass Decoder Design for Large Vocabulary Recognition, Proc. ARPA Human Language Technology Workshop, pp.405-410 (1994).
4. R.Schwartz et al.: A Comparison of Several Approximate Algorithms for Finding Multiple (N-best) Sentence Hypotheses, Proc. IEEE-ICASSP, pp701-704 (1991).
5. J.K.Chen, F.K.Soong and L.S.Lee: Large Vocabulary Word Recognition Based on Tree-Trellis Search, Proc. IEEE-ICASSP, pp137-140 (1994).
6. K.Itou, M.Yamamoto, K.Takeda, T.Takezawa, T.Matsuoka, T.Kobayashi, K.Shikano and S.Itahashi: The Design of the Newspaper-Based Japanese Large Vocabulary Continuous Speech Recognition Corpus, Proc.ICSLP (1998).
7. T.Kawahara, T.Kobayashi, K.Takeda, N.Minematsu, K.Itou, M.Yamamoto, A.Tamada, T.Utsuro and K.Shikano: Sharable Software Repository for Japanese Large Vocabulary Continuous Speech Recognition, Proc.ICSLP (1998)