The Grammar Does the Work: Functional vs. Lexical Dependency Length Minimization Across Universal Dependencies

arXiv cs.CL Papers

Summary

This paper analyzes 122 languages to show that dependency length minimization operates differently for functional dependencies (short and invariant) versus lexical dependencies (longer and variable), suggesting that grammar provides local scaffolding for processing.

arXiv:2607.01899v1 Announce Type: new Abstract: Dependency length minimization (DLM) is a well-documented processing universal, but previous studies report a single mean dependency distance (MDD) per language, obscuring variation across syntactic relation types. We analyze 122 languages in UD and SUD (version 2.17), showing that DLM operates on two distinct levels. Grammar-driven optimization targets functional dependencies (det, case, aux), which are universally short (mean 1.71, $\sigma$ = 0.33) and invariant across typologically diverse languages. Processing-driven optimization operates on lexical dependencies (nsubj, obj, obl), which are longer (mean 2.87), highly variable ($\sigma$ = 0.63), and constrained by word-order typology. This asymmetry holds in SUD despite reversed head direction (r = 0.92). We conclude that ''the grammar does the work'' of minimization by scaffolding sentences with local functional attachments, leaving processing pressures to determine the ordering of lexical heads.
Original Article
View Cached Full Text

Cached at: 07/03/26, 05:41 AM

# The Grammar Does the Work: Functional vs. Lexical Dependency Length Minimization Across Universal Dependencies
Source: [https://arxiv.org/abs/2607.01899](https://arxiv.org/abs/2607.01899)
[View PDF](https://arxiv.org/pdf/2607.01899)

> Abstract:Dependency length minimization \(DLM\) is a well\-documented processing universal, but previous studies report a single mean dependency distance \(MDD\) per language, obscuring variation across syntactic relation types\. We analyze 122 languages in UD and SUD \(version 2\.17\), showing that DLM operates on two distinct levels\. Grammar\-driven optimization targets functional dependencies \(det, case, aux\), which are universally short \(mean 1\.71, $\\sigma$ = 0\.33\) and invariant across typologically diverse languages\. Processing\-driven optimization operates on lexical dependencies \(nsubj, obj, obl\), which are longer \(mean 2\.87\), highly variable \($\\sigma$ = 0\.63\), and constrained by word\-order typology\. This asymmetry holds in SUD despite reversed head direction \(r = 0\.92\)\. We conclude that ''the grammar does the work'' of minimization by scaffolding sentences with local functional attachments, leaving processing pressures to determine the ordering of lexical heads\.

## Submission history

From: kim gerdes \[[view email](https://arxiv.org/show-email/cb10fed4/2607.01899)\] \[via CCSD proxy\] **\[v1\]**Thu, 2 Jul 2026 08:55:07 UTC \(1,602 KB\)

Similar Articles

On the Persistent Effects of Lexicality in Large Language Mod

arXiv cs.CL

This paper investigates how lexical overlap, rather than semantic content, influences LLM representations across layers and architectures, and demonstrates that this lexical effect persists even in models trained for semantic similarity, leading to degraded performance on downstream tasks.

Measuring language complexity from hierarchical reuse of recurring patterns

arXiv cs.CL

Introduces the ladderpath index as a measure of language complexity based on algorithmic information theory, applied to 21 parallel corpora. The index is approximately invariant across languages, supporting the equi-complexity hypothesis, and reveals trade-offs between character inventory and corpus length.