How to measure the optimality of word or gesture order with respect to the principle of swap distance minimization
Not on the map. Why?
Abstract (arXiv)
The structure of all the permutations of a sequence can be represented as a permutohedron, a graph where vertices are permutations and two vertices are linked if a swap of adjacent elements in the permutation of one of the vertices produces the permutation of the other vertex. It has been hypothesized that word orders in languages minimize the swap distance in the permutohedron: given a source order, word orders that are closer in the permutohedron should be less costly and thus more likely. Here we explain how to measure the degree of optimality of word order variation with respect to swap distance minimization. We illustrate the power of our novel mathematical framework by examining spontaneous gestures produced by speakers from four languages (two SVO languages and two VSO languages, which represent two linguistic families). We show that crosslinguistic gestures are at least 77% optimal. It is unlikely that the multiple times where crosslinguistic gestures hit optimality are due to chance. We establish the theoretical foundations for research on the optimality of word or gesture order with respect to swap distance minimization in communication systems. Finally, we introduce the quadratic assignment problem (QAP) into language research as an umbrella for multiple optimization problems and, accordingly, postulate a general principle of optimal assignment that unifies various linguistic principles including swap distance minimization.
Key facts. Cited by 1 paper in the map (data through 7 Oct 2026). Builds on 20 of its 86 references that are in the map. First posted on arXiv 2 Apr 2026.
Builds on
20 of 86 references.
References · 20
- 2023Contrasting Linguistic Patterns in Human and LLM-Generated News Textcited by 62
- 2020The optimality of syntactic dependency distancescited by 15
- 2019Optimal coding and the origins of Zipfian lawscited by 10
- 2021Minimum projective linearizations of trees in linear timecited by 9
- 2013The placement of the head that minimizes online memory: a complex systems approachcited by 8
- 2016The scarcity of crossing dependencies: a direct outcome of a specific constraint?cited by 7
- 2015Kauffman's adjacent possible in word order evolutioncited by 6
- 2019Memory limitations are hidden in grammarcited by 6
- 2013Compression as a universal principle of animal behaviorcited by 5
- 2021Linear-time calculation of the expected sum of edge lengths in random projective linearizations of treescited by 5
- 2023Linguistic laws in biologycited by 5
- 2023Swap distance minimization in SOV languages. Cognitive and mathematical foundationscited by 5
8 more
- 2013Transitive Reduction of Citation Networkscited by 4
- 2023Direct and indirect evidence of compression of word lengths. Zipf's law of abbreviation revisitedcited by 4
- 2024Swap distance minimization beyond entropy minimization in word order variationcited by 4
- 2014A stronger null hypothesis for crossing dependenciescited by 3
- 2023Corrections of Zipf's and Heaps' Laws Derived from Hapax Rate Modelscited by 3
- 2022The expected sum of edge lengths in planar linearizations of trees. Theory and applicationscited by 2
- 2022The optimality of word lengths. Theoretical foundations and an empirical studycited by 1
- 2025The exponential distribution of the order of demonstrative, numeral, adjective and nouncited by 1
Built on by
Citing papers per year: 2026: 1.
1 paper.