메뉴 건너뛰기




Volumn 3, Issue 1, 1996, Pages 4-6

Phone deactivation pruning in large vocabulary continuous speech recognition

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; ERRORS; ESTIMATION; MARKOV PROCESSES; MATHEMATICAL MODELS; PROBABILITY;

EID: 0029733137     PISSN: 10709908     EISSN: None     Source Type: Journal    
DOI: 10.1109/97.475820     Document Type: Article
Times cited : (7)

References (7)
  • 1
    • 0027668050 scopus 로고
    • Back-propagation uses prior information efficiently
    • E. Barnard and E. C. Botha, "Back-propagation uses prior information efficiently," IEEE Trans. Neural Networks, vol. 4, pp. 794-802, 1993.
    • (1993) IEEE Trans. Neural Networks , vol.4 , pp. 794-802
    • Barnard, E.1    Botha, E.C.2
  • 4
    • 0028420015 scopus 로고
    • Improvements in beam search for 10 000-word continuous-speech recognition
    • R. Haeb-Umbach and H. Ney, "Improvements in beam search for 10 000-word continuous-speech recognition," IEEE Trans. Speech Audio Processing, vol. 2, pp. 353-356, 1994.
    • (1994) IEEE Trans. Speech Audio Processing , vol.2 , pp. 353-356
    • Haeb-Umbach, R.1    Ney, H.2
  • 7
    • 0028392167 scopus 로고
    • The application of recurrent nets to phone probability estimation
    • A. J. Robinson, "The application of recurrent nets to phone probability estimation," IEEE Trans. Neural Networks, vol. 5, pp. 298-305, 1994.
    • (1994) IEEE Trans. Neural Networks , vol.5 , pp. 298-305
    • Robinson, A.J.1


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