메뉴 건너뛰기




Volumn 34, Issue 4, 2008, Pages 513-553

Algorithms for deterministic incremental dependency parsing

Author keywords

[No Author keywords available]

Indexed keywords

SYNTACTICS;

EID: 57349126314     PISSN: 08912017     EISSN: 15309312     Source Type: Journal    
DOI: 10.1162/coli.07-056-R1-07-027     Document Type: Article
Times cited : (366)

References (47)
  • 1
    • 0040402555 scopus 로고
    • Memory requirements and local ambiguities of parsing strategies
    • Abney, Steven and Mark Johnson. 1991. Memory requirements and local ambiguities of parsing strategies. Journal of Psycholinguists Research, 20:233-250.
    • (1991) Journal of Psycholinguists Research , vol.20 , pp. 233-250
    • Abney, S.1    Johnson, M.2
  • 2
    • 33846012075 scopus 로고    scopus 로고
    • Aho, Alfred V, Ravi Sethi, and Jeffrey D. Ullman. 1986. Compilers:, Addison-Wesley, Reading, MA
    • Aho, Alfred V., Ravi Sethi, and Jeffrey D. Ullman. 1986. Compilers: Principles, Techniques, and Tools. Addison-Wesley, Reading, MA.
    • Principles, Techniques, and Tools
  • 4
    • 34447631680 scopus 로고    scopus 로고
    • The Prague Dependency Treebank: A three-level annotation scenario
    • Anne Abeille, editor, Kluwer Academic Publishers, Dordrecht
    • Böhmová, Alena, Jan Hajič, Eva Hajičová, and Barbora Hladká. 2003. The Prague Dependency Treebank: A three-level annotation scenario. In Anne Abeille, editor, Treebanks: Building and Using Parsed Corpora. Kluwer Academic Publishers, Dordrecht, pages 103-127.
    • (2003) Treebanks: Building and Using Parsed Corpora , pp. 103-127
    • Böhmová, A.1    Hajič, J.2    Hajičová, E.3    Hladká, B.4
  • 6
    • 0003710380 scopus 로고    scopus 로고
    • LIBSVM: A Library for Support Vector Machines
    • Chang, Chih-Chung and Chih-Jen Lin, 2001. LIBSVM: A Library for Support Vector Machines. Software available at http: //www.csie.ntu.edu.tw/ ~cjlin/libsvm.
    • (2001) Software available at http
    • Chang, C.-C.1    Lin, C.-J.2
  • 11
    • 57349195783 scopus 로고    scopus 로고
    • Hajič, Jan, Barbora Vidova Hladka, Jarmila Panevová, Eva Hajičová, Petr Sgall, and Petr Pajas. 2001. Prague Dependency Treebank 1.0. LDC, 2001T10.
    • Hajič, Jan, Barbora Vidova Hladka, Jarmila Panevová, Eva Hajičová, Petr Sgall, and Petr Pajas. 2001. Prague Dependency Treebank 1.0. LDC, 2001T10.
  • 19
  • 20
    • 57349113263 scopus 로고    scopus 로고
    • Marcus, Mitchell P., Beatrice Santorini, Mary Ann Marcinkiewicz, Robert MacIntyre, Ann Bies, Mark Ferguson, Karen Katz, and Britta Schasberger. 1994. The Penn Treebank: Annotating predicate-argument structure. In Proceedings of the ARPA Human Language Technology Workshop, pages 114-119, Plainsboro, NJ.
    • Marcus, Mitchell P., Beatrice Santorini, Mary Ann Marcinkiewicz, Robert MacIntyre, Ann Bies, Mark Ferguson, Karen Katz, and Britta Schasberger. 1994. The Penn Treebank: Annotating predicate-argument structure. In Proceedings of the ARPA Human Language Technology Workshop, pages 114-119, Plainsboro, NJ.
  • 40
    • 0032660854 scopus 로고    scopus 로고
    • Learning to parse natural language with maximum entropy models
    • Ratnaparkhi, Adwait. 1999. Learning to parse natural language with maximum entropy models. Machine Learning, 34:151-175.
    • (1999) Machine Learning , vol.34 , pp. 151-175
    • Ratnaparkhi, A.1


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