메뉴 건너뛰기




Volumn , Issue , 2005, Pages 741-744

Using random forest language models in the IBM RT-04 CTS system

Author keywords

[No Author keywords available]

Indexed keywords

FORMAL LANGUAGES; INFORMATION ANALYSIS; SPEECH COMMUNICATION; STEREOPHONIC RECEIVERS; TELEPHONE SYSTEMS; VOCABULARY CONTROL;

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

References (14)
  • 1
    • 0003396042 scopus 로고    scopus 로고
    • An empirical study of smoothing techniques for language modeling
    • Computer Science Group, Harvard University, Cambridge, Massachusetts
    • Stanley F. Chen and Joshua Goodman, "An empirical study of smoothing techniques for language modeling," Tech. Rep. TR-10-98, Computer Science Group, Harvard University, Cambridge, Massachusetts, 1998.
    • (1998) Tech. Rep. , vol.TR-10-98
    • Chen, S.F.1    Goodman, J.2
  • 3
    • 0032089995 scopus 로고    scopus 로고
    • A study of n-gram and decision tree letter language modeling methods
    • Gerasimos Potamianos and Frederick Jelinek, "A study of n-gram and decision tree letter language modeling methods," Speech Communication, vol. 24(3), pp. 171-192, 1998.
    • (1998) Speech Communication , vol.24 , Issue.3 , pp. 171-192
    • Potamianos, G.1    Jelinek, F.2
  • 5
    • 33745212584 scopus 로고    scopus 로고
    • DARPA, November
    • DARPA, NIST RT-04 Workshop, DARPA, November 2004.
    • (2004) NIST RT-04 Workshop
  • 10
    • 0032049073 scopus 로고    scopus 로고
    • Algorithms for bigram and trigram word clustering
    • S. Martin, J. Liermann, and H. Ney, "Algorithms for bigram and trigram word clustering," Speech Communication, vol. 24(3), pp. 171-192, 1998.
    • (1998) Speech Communication , vol.24 , Issue.3 , pp. 171-192
    • Martin, S.1    Liermann, J.2    Ney, H.3
  • 12
    • 0001492549 scopus 로고    scopus 로고
    • Shape quantization and recognition with randomized trees
    • Y. Amit and D. Geman, "Shape quantization and recognition with randomized trees," Neural Computation, vol. 9, pp. 1545-1588, 1997.
    • (1997) Neural Computation , vol.9 , pp. 1545-1588
    • Amit, Y.1    Geman, D.2
  • 13
    • 0041382385 scopus 로고    scopus 로고
    • Random forests
    • Statistics Department, University of California, Berkeley, Berkeley, CA
    • Leo Breiman, "Random forests," Tech. Rep., Statistics Department, University of California, Berkeley, Berkeley, CA, 2001.
    • (2001) Tech. Rep.
    • Breiman, L.1
  • 14
    • 0032139235 scopus 로고    scopus 로고
    • The random subspace method for constructing decision forests
    • T.K. Ho, "The random subspace method for constructing decision forests," IEEE Trans. on Pattern Analysis and Machine Intelligence, vol. 20, no. 8, pp. 832-844, 1998.
    • (1998) IEEE Trans. on Pattern Analysis and Machine Intelligence , vol.20 , Issue.8 , pp. 832-844
    • Ho, T.K.1


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