Projectivity is a property of a dependency tree where no dependency arcs cross when the sentence is drawn linearly above the words. In a projective parse, all arcs are nested or adjacent, meaning that for any head-dependent pair, all words between them are also dominated by that head. This constraint simplifies parsing algorithms and holds for the majority of constructions in strictly configurational languages like English.
Glossary
Projectivity

What is Projectivity?
A structural constraint in syntactic analysis that governs the linear arrangement of grammatical relationships within a sentence.
A non-projective parse contains crossing arcs, which are necessary to accurately represent long-distance dependencies, wh-movement, and the free word order found in morphologically rich languages such as Czech or Dutch. Graph-based parsers using the Chu-Liu/Edmonds algorithm can decode non-projective structures, while transition-based systems often require additional swap operations or pseudo-projective transformations to handle these crossing edges.
Key Properties of Projectivity
Projectivity is a structural property of dependency trees that governs whether crossing arcs are permitted when a sentence is drawn linearly above its tokens. Understanding this constraint is fundamental to parser design and cross-linguistic syntax.
Formal Definition of Projectivity
A dependency arc from a head word h to a dependent word d is projective if and only if all words linearly positioned between h and d are also descendants of h in the dependency tree. A tree is fully projective if every one of its arcs satisfies this condition. This property ensures that the tree can be drawn in the half-plane above the sentence without any crossing edges, preserving a planar graph structure that simplifies both parsing algorithms and linguistic annotation.
Non-Projectivity and Free Word Order
A non-projective parse contains at least one crossing dependency, a phenomenon prevalent in languages with free word order and rich morphology. For example, in German subordinate clauses, the verb appears at the end while its arguments may be scattered, creating crossing arcs. Similarly, wh-movement in English ('What did you see?') can produce non-projective structures. Parsers restricted to projective trees, such as basic transition-based models, systematically fail on these constructions, necessitating specialized algorithms like the Chu-Liu/Edmonds maximum spanning tree approach.
Projectivity in Transition-Based Parsing
Standard arc-eager and arc-standard shift-reduce parsers are inherently limited to producing only projective trees because they build dependencies incrementally from left to right without the ability to create arcs that skip over unattached tokens. To handle non-projectivity, extensions like the swap-based algorithm introduce a SWAP transition that reorders the buffer, effectively linearizing crossing arcs. Alternatively, pseudo-projective parsing converts non-projective training trees into projective ones using specific encoding schemes, then decodes the output back to the original structure.
Projectivity and the Maximum Spanning Tree
Graph-based parsers do not suffer from the projective constraint of transition-based systems. They score all possible arcs in a sentence simultaneously and decode the optimal tree using the Chu-Liu/Edmonds algorithm, which finds the maximum spanning tree in a directed graph. This algorithm naturally handles non-projective structures without special extensions, making graph-based methods the default choice for parsing languages with frequent crossing dependencies. The trade-off is computational complexity: O(n²) for arc-factored models versus O(n) for greedy transition-based parsing.
Gap Degree and Planarity Metrics
The gap degree of a dependency tree quantifies its deviation from projectivity. A gap occurs when a discontinuity in the projection of a node interrupts the linear span of its descendants. The maximum number of such discontinuities across all nodes defines the tree's gap degree. A projective tree has a gap degree of 0. Well-nestedness is a related constraint: a tree is well-nested if no two disjoint subtrees interleave. These metrics are used to characterize the syntactic complexity of treebanks and to design parsers with bounded non-projectivity handling.
Projectivity in Universal Dependencies
The Universal Dependencies (UD) framework annotates both projective and non-projective structures, with the CoNLL-U format capturing the linear order and head indices necessary to reconstruct crossing arcs. UD treebanks reveal significant cross-linguistic variation: languages like English and French exhibit low non-projectivity rates, while Czech, Dutch, and Ancient Greek have substantially higher proportions. This variation directly impacts parser evaluation, as the Labeled Attachment Score (LAS) often drops on non-projective arcs, motivating the use of enhanced dependency representations.
Projective vs. Non-Projective Parses
Structural comparison of projective and non-projective dependency trees based on arc crossing, word order constraints, and parsing complexity.
| Feature | Projective Parse | Non-Projective Parse |
|---|---|---|
Crossing Arcs | ||
Arc Intersection with Head Projection | ||
Decoding Algorithm | Eisner's O(n³) | Chu-Liu/Edmonds O(n²) |
Word Order Assumption | Contiguous constituents | Discontinuous constituents allowed |
Typical Language Fit | English, Chinese (configurational) | Czech, Dutch, German (free word order) |
Wh-Movement Representation | Requires trace or enhanced dependencies | Directly represented via crossing arc |
Treebank Prevalence (UD 2.12) | ~75-80% of sentences | ~20-25% of sentences |
Parsing Complexity Class | Polynomial (projective constraint) | NP-hard (exact non-projective MST) |
Enabling Efficiency, Speed & Accuracy
Intelligent Analysis, Decision & Execution
We build AI systems for teams that need search across company data, workflow automation across tools, or AI features inside products and internal software.
Talk to Us
Search across company data
Give teams answers from docs, tickets, runbooks, and product data with sources and permissions.
Useful when people spend too long searching or get different answers from different systems.

Automate internal workflows
Use AI to route work, draft outputs, trigger actions, and keep approvals and logs in place.
Useful when repetitive work moves across multiple tools and teams.

Add AI to products and internal tools
Build assistants, guided actions, or decision support into the software your team or customers already use.
Useful when AI needs to be part of the product, not a separate tool.
Frequently Asked Questions
Clear answers to common questions about projectivity, a critical property of dependency trees that determines whether a parse can be represented without crossing arcs.
Projectivity is a formal property of a dependency tree where no crossing arcs exist when the sentence is drawn linearly above the text. In a projective parse, for every dependency arc from a syntactic head h to a dependent d, all words between h and d must be descendants of h. This means the tree can be drawn without any edges intersecting. Projectivity is the default assumption in many parsing algorithms because it simplifies decoding to O(n³) dynamic programming, but it fails to capture long-distance dependencies common in languages with free word order, such as Czech, German, and Hindi. The concept originates from formal grammar theory and remains a central constraint in transition-based parsing systems like MaltParser and the spaCy Dependency Parser.
Linguistic Phenomena Requiring Non-Projectivity
Non-projective parses are not parser errors but linguistically necessary structures for representing specific syntactic phenomena. These constructions force crossing arcs in the dependency tree, requiring specialized decoding algorithms like the Chu-Liu/Edmonds algorithm.
Wh-Movement
In interrogative sentences, a wh-word (who, what, which) is fronted to the beginning of the clause while maintaining a syntactic dependency with its governing verb deeper in the sentence. This long-distance dependency creates a crossing arc over intervening words.
- Example: "What did you say that John bought?" — What depends on bought, crossing over the subject and auxiliary verbs.
- Common in English, German, and other languages with syntactic movement.
- Requires the parser to link a fronted constituent to a gap position far to the right.
Free Word Order Languages
Morphologically rich languages like Latin, Turkish, and Japanese permit flexible constituent ordering because grammatical roles are marked by case inflection rather than position. This scrambling frequently produces non-projective structures.
- Example (Latin): "Puer puellam vidit" and "Puellam puer vidit" both mean "The boy saw the girl."
- Discontinuous noun phrases where modifiers are separated from their heads are common.
- Parsers trained on fixed-word-order languages like English often fail catastrophically on these constructions.
Extraposition
A syntactic phenomenon where a heavy constituent, typically a relative clause or complement clause, is shifted to the right edge of the sentence, separating it from the noun it modifies. This rightward movement creates a non-projective arc.
- Example: "A woman arrived who was wearing a red hat." — who was wearing a red hat modifies woman, but the verb arrived intervenes.
- Common in English and Germanic languages for stylistic or processing reasons.
- The dependent appears linearly after material that is structurally higher in the tree.
Control and Raising Constructions
In subject control and subject-to-subject raising constructions, a nominal element serves as the syntactic subject of a matrix verb while functioning as the semantic argument of an embedded verb. This dual role can force non-projective arcs in surface syntax representations.
- Example (Raising): "John seems to be happy." — John is the syntactic subject of seems but the semantic subject of happy.
- Example (Control): "Mary promised to leave." — Mary controls the unexpressed subject of to leave.
- Enhanced dependency representations explicitly add these arcs.
Discontinuous Noun Phrases
In languages like German and Dutch, modifiers of a noun can be separated from their head by intervening verbal material, particularly in verb-final clauses. This creates a crossing dependency where the determiner and noun are not adjacent.
- Example (German): "Ich habe den Mann gestern gesehen, der den Hut trug." — den Mann and der den Hut trug form a discontinuous constituent.
- Driven by the interaction of the verbal complex and the nominal phrase.
- Requires parsers to handle long-range attachment across clause boundaries.
Clitic Climbing
In Romance languages like Spanish and Italian, a pronominal clitic that semantically belongs to an embedded infinitive can attach syntactically to a higher matrix verb. This restructuring creates a non-projective dependency between the clitic and the embedded verb.
- Example (Spanish): "Lo quiero ver." ("I want to see it.") — Lo attaches to quiero but is the object of ver.
- The clitic moves leftward across the matrix verb, crossing syntactic boundaries.
- Challenges parsers that assume strict locality between a verb and its arguments.

About the author
Prasad Kumkar
CEO & MD, Inference Systems
Prasad Kumkar is the CEO & MD of Inference Systems and writes about AI systems architecture, LLM infrastructure, model serving, evaluation, and production deployment. Over 5+ years, he has worked across computer vision models, L5 autonomous vehicle systems, and LLM research, with a focus on taking complex AI ideas into real-world engineering systems.
His work and writing cover AI systems, large language models, AI agents, multimodal systems, autonomous systems, inference optimization, RAG, evaluation, and production AI engineering.
Partnered with leading AI, data, and software stack.
How We Work
Custom AI workflows for your Business
One-fit-all AI don't work for modern businesses. At Inferensys, we aim to understand your business & custom requirements; which we use to define most efficient agentic workflows, the data, and the tools for your business.
01
Review the use case
We understand the task, the users, and where AI can actually help.
Read more02
Pick the right approach
We define what needs search, automation, or product integration.
Read more03
Build the first useful version
We implement the part that proves the value first.
Read more04
Improve from there
We add the checks and visibility needed to keep it useful.
Read moreThe first call is a practical review of your use case and the right next step.
Talk to Us