mlsanityData to 13 Oct 2026

Work Smarter...Not Harder: Efficient Minimization of Dependency Length in SOV Languages

arXiv 2404.18684 ↗First posted 29 Apr 2024cs.CL econ.TH math.OCcited by 1

Not on the map. Why?

Abstract (arXiv)

Dependency length minimization is a universally observed quantitative property of natural languages. However, the extent of dependency length minimization, and the cognitive mechanisms through which the language processor achieves this minimization remain unclear. This research offers mechanistic insights by postulating that moving a short preverbal constituent next to the main verb explains preverbal constituent ordering decisions better than global minimization of dependency length in SOV languages. This approach constitutes a least-effort strategy because it's just one operation but simultaneously reduces the length of all preverbal dependencies linked to the main verb. We corroborate this strategy using large-scale corpus evidence across all seven SOV languages that are prominently represented in the Universal Dependency Treebank. These findings align with the concept of bounded rationality, where decision-making is influenced by 'quick-yet-economical' heuristics rather than exhaustive searches for optimal solutions. Overall, this work sheds light on the role of bounded rationality in linguistic decision-making and language evolution.

Key facts. Cited by 1 paper in the map (data through 13 Oct 2026). Builds on 2 of its 36 references that are in the map. First posted on arXiv 29 Apr 2024.

Builds on

2 of 36 references.

References · 2

  1. 2013The risks of mixing dependency lengths from sequences of different lengthcited by 7
  2. 2023A bounded rationality account of dependency length minimization in Hindicited by 2

Built on by

Cited by year

Citing papers per year: 2024: 1.

1 paper.