Relationship between non-projective edges, their level types, and well-nestedness

NAACL-HLT 2007 - Human Language Technology Conference of the North American Chapter of the Association of Computational Linguistics, Companion Volume: Short Papers

Volumn , Issue , 2007, Pages 61-64

  Havelka, Jiří ^a  

^a CHARLES UNIVERSITY   (Czech Republic)

Author keywords

[No Author keywords available]

Indexed keywords

DEPENDENCY ANALYSIS; DEPENDENCY TREES; LINGUISTIC DATA; NATURAL LANGUAGES; NESTEDNESS; PROJECTIVE STRUCTURE; PROPERTY; SIMPLE++;

TREES (MATHEMATICS);

EID: 77955465451     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (6)

1. Jiří Havelka. 2005. Projectivity in Totally Ordered Rooted Trees: An Alternative Definition of Projectivity and Optimal Algorithms for Detecting Non-Projective Edges and Projectivizing Totally Ordered Rooted Trees. Prague Bulletin of Mathematical Linguistics, 84:13-30.
2. Marco Kuhlmann and Joakim Nivre. 2006. Mildly Non-Projective Dependency Structures. In Proceedings of COLING/ACL, pages 507-514.
3. Ryan McDonald, Fernando Pereira, Kiril Ribarov, and Jan Hajič. 2005. Non-Projective Dependency Parsing using Spanning Tree Algorithms. In Proceedings of HLT/EMNLP, pages 523-530.
4. Mathias Möhl. 2006. Drawings as models of syntactic structure: Theory and algorithms. Diploma thesis, Programming Systems Lab, Universität des Saarlandes, Saarbrücken.
5. Joakim Nivre. 2006. Constraints on Non-Projective Dependency Parsing. In Proc. of EACL, pages 73-80.
6. Neil J. A. Sloane. 2007. On-Line Encyclopedia of Integer Sequences. Published electronically at www.research.att.com/~njas/sequences/.