Various formal constraints on dependency trees are explored as a middle ground between projectivity and fully unrestricted structures to better model real language.
A tree that is not ill-nested is said to bewell-nested
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.CL 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Formal Constraints on Dependency Syntax
Various formal constraints on dependency trees are explored as a middle ground between projectivity and fully unrestricted structures to better model real language.