메뉴 건너뛰기




Volumn 39, Issue 4, 2013, Pages 799-845

Divisible Transition Systems and Multiplanar Dependency Parsing

Author keywords

[No Author keywords available]

Indexed keywords

FORESTRY;

EID: 84888117621     PISSN: 08912017     EISSN: 15309312     Source Type: Journal    
DOI: 10.1162/COLI_a_00150     Document Type: Article
Times cited : (43)

References (78)
  • 4
    • 84859887414 scopus 로고    scopus 로고
    • Event matching using the transitive closure of dependency relations
    • In Columbus, OH
    • Bikel, Daniel M. and Vittorio Castelli. 2008. Event matching using the transitive closure of dependency relations. In Proceedings of ACL-08: HLT, Short Papers, pages 145-148, Columbus, OH.
    • (2008) Proceedings of ACL-08: HLT, Short Papers , pp. 145-148
    • Bikel, D.M.1    Castelli, V.2
  • 6
    • 34447631680 scopus 로고    scopus 로고
    • The Prague Dependency Treebank: A three-level annotation scenario
    • In Anne Abeillé, editor, Kluwer
    • Böhmová, Alena, Jan Hajič, Eva Hajičová, and Barbora Hladká. 2003. The Prague Dependency Treebank: A three-level annotation scenario. In Anne Abeillé, editor, Treebanks: Building and Using Parsed Corpora. Kluwer, 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
  • 10
  • 17
    • 80052200655 scopus 로고    scopus 로고
    • Dependency parsing schemata and mildly non-projective dependency parsing
    • Gómez-Rodríguez, Carlos, John Carroll, and David Weir. 2011. Dependency parsing schemata and mildly non-projective dependency parsing. Computational Linguistics, 37(3):541-586.
    • (2011) Computational Linguistics , vol.37 , Issue.3 , pp. 541-586
    • Gómez-Rodríguez, C.1    Carroll, J.2    Weir, D.3
  • 29
    • 0003037529 scopus 로고
    • Reducibility among combinatorial problems
    • In R. Miller and J. Thatcher, editors, Plenum Press
    • Karp, Richard M. 1972. Reducibility among combinatorial problems. In R. Miller and J. Thatcher, editors, Complexity of Computer Computations. Plenum Press, pages 85-103.
    • (1972) Complexity of Computer Computations , pp. 85-103
    • Karp, R.M.1
  • 39
    • 34249852033 scopus 로고
    • Building a large annotated corpus of English: The Penn Treebank
    • Marcus, Mitchell P., Beatrice Santorini, and Mary Ann Marcinkiewicz. 1993. Building a large annotated corpus of English: The Penn Treebank. Computational Linguistics, 19:313-330.
    • (1993) Computational Linguistics , vol.19 , pp. 313-330
    • Marcus, M.P.1    Santorini, B.2    Marcinkiewicz, M.A.3
  • 55
    • 57349126314 scopus 로고    scopus 로고
    • Algorithms for deterministic incremental dependency parsing
    • Nivre, Joakim. 2008. Algorithms for deterministic incremental dependency parsing. Computational Linguistics, 34:513-553.
    • (2008) Computational Linguistics , vol.34 , pp. 513-553
    • Nivre, J.1


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