메뉴 건너뛰기




Volumn 3, Issue , 2000, Pages 1555-1558

DUcoder-the Duisburg University LVCSR stackdecoder

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL LINGUISTICS; SIGNAL PROCESSING; SPEECH PROCESSING; ALGORITHMS; BIT ERROR RATE; COMPUTER SIMULATION; DECODING; ERROR ANALYSIS; MATHEMATICAL MODELS; MAXIMUM LIKELIHOOD ESTIMATION; NATURAL LANGUAGE PROCESSING SYSTEMS; SPEECH RECOGNITION;

EID: 0033708110     PISSN: 15206149     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ICASSP.2000.861966     Document Type: Conference Paper
Times cited : (13)

References (11)
  • 1
    • 0033097333 scopus 로고    scopus 로고
    • State-based Gaussian selection in LVCSR using HMM's
    • M. J. F. Gales, K. M. Knill, S. J. Young: "State-Based Gaussian Selection in LVCSR using HMM's", IEEE Trans. on SAP, Vol. 7, No. 2, 1999.
    • (1999) IEEE Trans. on SAP , vol.7 , Issue.2
    • Gales, M.J.F.1    Knill, K.M.2    Young, S.J.3
  • 2
    • 0028996969 scopus 로고    scopus 로고
    • A tree search strategy for large-vocabulary continuous speech recognition
    • P. S. Gopalakrishnan, L. R. Bahl, R. L. Mercer: "A Tree Search Strategy for Large-Vocabulary Continuous Speech Recognition"', ICASSP'95, pp. 572-575.
    • ICASSP'95 , pp. 572-575
    • Gopalakrishnan, P.S.1    Bahl, L.R.2    Mercer, R.L.3
  • 3
    • 84955670013 scopus 로고    scopus 로고
    • Reduced lexicon trees for decoding in a MMI-connectionist/HMM speech recognition system
    • C. Neukirchen, D. Willett, G. Rigoll: "Reduced Lexicon Trees for Decoding in a MMI-Connectionist/HMM Speech Recognition System", Eurosp. '97, pp. 2639-2642.
    • Eurosp. '97 , pp. 2639-2642
    • Neukirchen, C.1    Willett, D.2    Rigoll, G.3
  • 5
    • 85017287102 scopus 로고    scopus 로고
    • ∗ stack decoder algorithm for continuous speech recognition with a stochastic language model
    • ∗ Stack Decoder Algorithm for Continuous Speech Recognition with a Stochastic Language Model", ICASSP'92, pp. 125-128.
    • ICASSP'92 , pp. 125-128
    • Paul, D.B.1
  • 7
    • 85017287070 scopus 로고    scopus 로고
    • Start-svnchronous search for LVCSR
    • S. Renals, M. Hochberg: "Start-Svnchronous Search for LVCSR", IEEE Trans. on SAP, Vol. 7, No. 5, 1999.
    • (1999) IEEE Trans. on SAP , vol.7 , Issue.5
    • Renals, S.1    Hochberg, M.2
  • 8
    • 85009091564 scopus 로고    scopus 로고
    • Nozomi - A fast, memory-efficient stack decoder for LVCSR
    • M. Schuster: "Nozomi - A fast, Memory-Efficient Stack Decoder for LVCSR", ICSLP'98, pp. 1835-1838.
    • ICSLP'98 , pp. 1835-1838
    • Schuster, M.1
  • 10
    • 33744595819 scopus 로고    scopus 로고
    • Efficient search with posterior probability estimates in HMM-based speech recognition
    • D. Willett, C. Neukirchen, G. Rigoll: "Efficient search with posterior probability estimates in HMM-based speech recognition", ICASSP'98, pp. 821-824.
    • ICASSP'98 , pp. 821-824
    • Willett, D.1    Neukirchen, C.2    Rigoll, G.3


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