Formal Constraints on Dependency Syntax

arXiv cs.CL / 4/7/2026

💬 OpinionSignals & Early TrendsIdeas & Deep AnalysisModels & Research

Key Points

  • Dependency syntax models sentences as dependency trees connecting lexical units with directed relations, but not all theoretically possible trees match attested language patterns.
  • Because unconstrained dependency trees can be too permissive, researchers study formal constraints that better capture realistic syntax, improve parsing accuracy/speed, and support hypotheses about language evolution and human processing.
  • Projectivity is a widely used constraint, but it can be too strict for flexible-word-order languages, motivating alternative or additional constraints.
  • The work surveys and positions multiple proposed constraints as a “middle ground” between overly restrictive projectivity and fully unrestricted dependency structures.
  • The paper is presented as a new arXiv announcement (arXiv:2604.04542v1), indicating an ongoing research effort rather than a deployed product or tool release.

Abstract

Dependency syntax represents the structure of a sentence as a tree composed of dependencies, i.e., directed relations between lexical units. While in its more general form any such tree is allowed, in practice many are not plausible or are very infrequent in attested language. This has motivated a search for constraints characterizing subsets of trees that better fit real linguistic phenomena, providing a more accurate linguistic description, faster parsing or insights on language evolution and human processing. Projectivity is the most well-studied such constraint, but it has been shown to be too restrictive to represent some linguistic phenomena, especially in flexible-word-order languages. Thus, a variety of constraints have been proposed to seek a realistic middle ground between the limitations of projectivity and the excessive leniency of unrestricted dependency structures.