Relationship between Non-Projective Edges, Their Level Types, and Well-Nestedness

Dependency analysis of natural language gives rise to non-projective structures. The constraint of well-nestedness on dependency trees has been recently shown to give a good fit with empirical linguistic data. We present a reformulation of this constraint using properties of nonprojective edges and show its formal relationship to level types of non-projective edges; we also derive a simple O(n2) algorithm for checking well-nestedness.

• Type: Conference
• Year: 2007
• Where: NAACL
• Authors: Jirí Havelka
• Keywords: Computational Linguistics, Dependency Analysis, Empirical Linguistic Data, Language Gives Rise, NAACL 2007