메뉴 건너뛰기




Volumn 2010-July, Issue , 2010, Pages 495-503

Minimized models and grammar-informed initialization for supertagging with highly ambiguous lexicons

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL LINGUISTICS; HIDDEN MARKOV MODELS; MAXIMUM PRINCIPLE; MODELING LANGUAGES; NATURAL LANGUAGE PROCESSING SYSTEMS;

EID: 85118448972     PISSN: 0736587X     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper
Times cited : (3)

References (19)
  • 3
    • 0032183995 scopus 로고    scopus 로고
    • The minimum description length principle in coding and modeling
    • A. R. Barron, J. Rissanen, and B. Yu. 1998. The minimum description length principle in coding and modeling. IEEE Transactions on Information Theory, 44(6):2743-2760.
    • (1998) IEEE Transactions on Information Theory , vol.44 , Issue.6 , pp. 2743-2760
    • Barron, A. R.1    Rissanen, J.2    Yu, B.3
  • 6
    • 37249086043 scopus 로고    scopus 로고
    • Wide-coverage efficient statistical parsing with CCG and log-linear models
    • S. Clark and J. Curran. 2007. Wide-coverage efficient statistical parsing with CCG and log-linear models. Computational Linguistics, 33(4).
    • (2007) Computational Linguistics , vol.33 , Issue.4
    • Clark, S.1    Curran, J.2
  • 8
    • 84859881696 scopus 로고    scopus 로고
    • EM can find pretty good HMM POS-taggers (when given a good start)
    • Columbus, Ohio, June
    • Y. Goldberg, M. Adler, and M. Elhadad. 2008. EM can find pretty good HMM POS-taggers (when given a good start). In Proceedings of the ACL, pages 746-754, Columbus, Ohio, June.
    • (2008) Proceedings of the ACL , pp. 746-754
    • Goldberg, Y.1    Adler, M.2    Elhadad, M.3
  • 9
    • 0041079008 scopus 로고    scopus 로고
    • Unsupervised learning of the morphology of a natural language
    • J. Goldsmith. 2001. Unsupervised learning of the morphology of a natural language. Computational Linguistics, 27(2):153-198.
    • (2001) Computational Linguistics , vol.27 , Issue.2 , pp. 153-198
    • Goldsmith, J.1
  • 10
    • 84860525845 scopus 로고    scopus 로고
    • A fully Bayesian approach to unsupervised part-of-speech tagging
    • Prague, Czech Republic, June
    • S. Goldwater and T. L. Griffiths. 2007. A fully Bayesian approach to unsupervised part-of-speech tagging. In Proceedings of the ACL, pages 744-751, Prague, Czech Republic, June.
    • (2007) Proceedings of the ACL , pp. 744-751
    • Goldwater, S.1    Griffiths, T. L.2
  • 12
    • 34748819951 scopus 로고    scopus 로고
    • CCGbank: A corpus of CCG derivations and dependency structures extracted from the Penn Treebank
    • J. Hockenmaier and M. Steedman. 2007. CCGbank: A corpus of CCG derivations and dependency structures extracted from the Penn Treebank. Computational Linguistics, 33(3):355-396.
    • (2007) Computational Linguistics , vol.33 , Issue.3 , pp. 355-396
    • Hockenmaier, J.1    Steedman, M.2
  • 13
    • 0002155440 scopus 로고
    • Tree Adjoining Grammars
    • David Dowty, Lauri Karttunen, and Arnold Zwicky, editors, pages Cambridge University Press, Cambridge
    • A. Joshi. 1988. Tree Adjoining Grammars. In David Dowty, Lauri Karttunen, and Arnold Zwicky, editors, Natural Language Parsing, pages 206-250. Cambridge University Press, Cambridge.
    • (1988) Natural Language Parsing , pp. 206-250
    • Joshi, A.1
  • 15
    • 84867119745 scopus 로고
    • Tagging English text with a probabilistic model
    • B. Merialdo. 1994. Tagging English text with a probabilistic model. Computational Linguistics, 20(2):155-171.
    • (1994) Computational Linguistics , vol.20 , Issue.2 , pp. 155-171
    • Merialdo, B.1


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