메뉴 건너뛰기




Volumn , Issue , 2003, Pages

Supervised and unsupervised PCFG adaptation to novel domains

Author keywords

[No Author keywords available]

Indexed keywords

CONTEXT FREE GRAMMARS; NATURAL LANGUAGE PROCESSING SYSTEMS;

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

References (22)
  • 4
    • 0039623923 scopus 로고    scopus 로고
    • Estimation of probabilistic context-free grammars
    • Zhiyi Chi and Stuart Geman. 1998. Estimation of probabilistic context-free grammars. Computational Linguistics, 24(2):299–305.
    • (1998) Computational Linguistics , vol.24 , Issue.2 , pp. 299-305
    • Chi, Zhiyi1    Geman, Stuart2
  • 8
    • 0032050110 scopus 로고    scopus 로고
    • Maximum likelihood linear transformations for hmm-based speech recognition
    • M. J. F. Gales. 1998. Maximum likelihood linear transformations for hmm-based speech recognition. Computer Speech and Language, pages 75–98.
    • (1998) Computer Speech and Language , pp. 75-98
    • Gales, M. J. F.1
  • 9
    • 0028419019 scopus 로고
    • Maximum a posteriori estimation for multivariate gaussian mixture observations of markov chains
    • Jean-Luc Gauvain and Chin-Hui Lee. 1994. Maximum a posteriori estimation for multivariate gaussian mixture observations of markov chains. IEEE Transactions on Speech and Audio Processing, 2(2):291–298.
    • (1994) IEEE Transactions on Speech and Audio Processing , vol.2 , Issue.2 , pp. 291-298
    • Gauvain, Jean-Luc1    Lee, Chin-Hui2
  • 15
    • 0005921873 scopus 로고    scopus 로고
    • PCFG models of linguistic tree representations
    • Mark Johnson. 1998. PCFG models of linguistic tree representations. Computational Linguistics, 24(4):617–636.
    • (1998) Computational Linguistics , vol.24 , Issue.4 , pp. 617-636
    • Johnson, Mark1
  • 17
    • 0029288633 scopus 로고
    • Maximum likelihood linear regression for speaker adaptation of continuous density hidden markov models
    • C. J. Legetter and P.C. Woodland. 1995. Maximum likelihood linear regression for speaker adaptation of continuous density hidden markov models. Computer Speech and Language, pages 171–185.
    • (1995) Computer Speech and Language , pp. 171-185
    • Legetter, C. J.1    Woodland, P.C.2
  • 19
    • 0032660854 scopus 로고    scopus 로고
    • Learning to parse natural language with maximum entropy models
    • Adwait Ratnaparkhi. 1999. Learning to parse natural language with maximum entropy models. Machine Learning, 34:151–175.
    • (1999) Machine Learning , vol.34 , pp. 151-175
    • Ratnaparkhi, Adwait1
  • 20
    • 0041079041 scopus 로고    scopus 로고
    • Probabilistic top-down parsing and language modeling
    • Brian Roark. 2001a. Probabilistic top-down parsing and language modeling. Computational Linguistics, 27(2):249–276.
    • (2001) Computational Linguistics , vol.27 , Issue.2 , pp. 249-276
    • Roark, Brian1
  • 22
    • 85118742711 scopus 로고    scopus 로고
    • Robust garden path parsing
    • Brian Roark. 2003. Robust garden path parsing. Natural Language Engineering, 9(2):1–24.
    • (2003) Natural Language Engineering , vol.9 , Issue.2 , pp. 1-24
    • Roark, Brian1


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