메뉴 건너뛰기




Volumn , Issue , 2000, Pages

Ewaves: An efficient decoding algorithm for lexical tree based speech recognition

Author keywords

[No Author keywords available]

Indexed keywords

CACHE MEMORY; CONTINUOUS SPEECH RECOGNITION; DYNAMIC PROGRAMMING; TREES (MATHEMATICS); VITERBI ALGORITHM;

EID: 84962845459     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper
Times cited : (7)

References (8)
  • 1
    • 0033889293 scopus 로고    scopus 로고
    • An efficient search space representation for large vocabulary continuous speech recognition
    • January
    • K. Demuynck, J. Duchateau, D. Van Compernolle, and P. Wambacq. An efficient search space representation for large vocabulary continuous speech recognition. Speech Communication, 30(1):37-54, January 2000.
    • (2000) Speech Communication , vol.30 , Issue.1 , pp. 37-54
    • Demuynck, K.1    Duchateau, J.2    Van Compernolle, D.3    Wambacq, P.4
  • 2
    • 85032751683 scopus 로고    scopus 로고
    • Hierarchical search for large vocabulary conversational speech recognition
    • September
    • Neeraj Deshmukh, Aravind Ganapathiraju, and Joseph Picone. Hierarchical Search for Large Vocabulary Conversational Speech Recognition. IEEE Signal Processing Magazine, 6(5):84-107, September 1999.
    • (1999) IEEE Signal Processing Magazine , vol.6 , Issue.5 , pp. 84-107
    • Deshmukh, N.1    Ganapathiraju, A.2    Picone, J.3
  • 3
    • 85032751521 scopus 로고    scopus 로고
    • Dynamic programming search for continuous speech recognition
    • September
    • Hermann Ney and Stefan Ortmanns. Dynamic Programming Search for Continuous Speech Recognition. IEEE Signal Processing Magazine, 6(5):63-83, September 1999.
    • (1999) IEEE Signal Processing Magazine , vol.6 , Issue.5 , pp. 63-83
    • Ney, H.1    Ortmanns, S.2


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