메뉴 건너뛰기




Volumn , Issue , 2004, Pages 325-332

Random forests in language modeling

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL LINGUISTICS; MODELING LANGUAGES; NATURAL LANGUAGE PROCESSING SYSTEMS; SPEECH RECOGNITION;

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

References (18)
  • 1
    • 0001492549 scopus 로고    scopus 로고
    • Shape quantization and recognition with randomized trees
    • Y. Amit and D. Geman. 1997. Shape quantization and recognition with randomized trees. Neural Computation, (9):1545-1588.
    • (1997) Neural Computation , Issue.9 , pp. 1545-1588
    • Amit, Y.1    Geman, D.2
  • 5
    • 0041382385 scopus 로고    scopus 로고
    • Technical report, Statistics Department, University of California, Berkeley, Berkeley, CA
    • Leo Breiman. 2001. Random forests. Technical report, Statistics Department, University of California, Berkeley, Berkeley, CA.
    • (2001) Random forests
    • Breiman, Leo1
  • 10
    • 0032139235 scopus 로고    scopus 로고
    • The random subspace method for constructing decision forests
    • T.K. Ho. 1998. The random subspace method for constructing decision forests. IEEE Trans. on Pattern Analysis and Machine Intelligence, 20(8):832-844.
    • (1998) IEEE Trans. on Pattern Analysis and Machine Intelligence , vol.20 , Issue.8 , pp. 832-844
    • Ho, T.K.1
  • 12
    • 0028996876 scopus 로고
    • Improved backing-off for m-gram language modeling
    • Reinhard Kneser and Hermann Ney. 1995. Improved backing-off for m-gram language modeling. In Proceedings of the ICASSP, volume 1, pages 181-184.
    • (1995) Proceedings of the ICASSP , vol.1 , pp. 181-184
    • Kneser, Reinhard1    Ney, Hermann2
  • 13
    • 0032049073 scopus 로고    scopus 로고
    • Algorithms for bigram and trigram word clustering
    • S. Martin, J. Liermann, and H. Ney. 1998. Algorithms for bigram and trigram word clustering. Speech Communication, 24:19-37.
    • (1998) Speech Communication , vol.24 , pp. 19-37
    • Martin, S.1    Liermann, J.2    Ney, H.3
  • 14
    • 0032089995 scopus 로고    scopus 로고
    • A study of n-gram and decision tree letter language modeling methods
    • Gerasimos Potamianos and Frederick Jelinek. 1998. A study of n-gram and decision tree letter language modeling methods. Speech Communication, 24(3):171-192.
    • (1998) Speech Communication , vol.24 , Issue.3 , pp. 171-192
    • Potamianos, Gerasimos1    Jelinek, Frederick2
  • 16
    • 0036293862 scopus 로고    scopus 로고
    • connectionist language modeling for large vocabulary continuous speech recognition
    • Orlando, Florida, May
    • Holger Schwenk and Jean-Luc Gauvain. 2002. connectionist language modeling for large vocabulary continuous speech recognition. In Proceedings of the ICASSP, pages 765-768, Orlando, Florida, May.
    • (2002) Proceedings of the ICASSP , pp. 765-768
    • Schwenk, Holger1    Gauvain, Jean-Luc2
  • 18
    • 27244441578 scopus 로고    scopus 로고
    • A study on richer syntactic dependencies for structured language modeling
    • Philadelphia, Pennsylvania, USA, July
    • Peng Xu, Ciprian Chelba, and Frederick Jelinek. 2002. A study on richer syntactic dependencies for structured language modeling. In Proceedings of the 40th Annual Meeting of the ACL, pages 191-198, Philadelphia, Pennsylvania, USA, July.
    • (2002) Proceedings of the 40th Annual Meeting of the ACL , pp. 191-198
    • Xu, Peng1    Chelba, Ciprian2    Jelinek, Frederick3


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