Swap distance minimization in SOV languages. Cognitive and mathematical foundations

Ramon Ferrer-i-Cancho, Savithry Namboodiripad
12/7/2023
cs.CLphysics.soc-ph

No confident code implementation found for this paper.

Abstract

Distance minimization is a general principle of language. A special case of this principle in the domain of word order is swap distance minimization. This principle predicts that variations from a canonical order that are reached by fewer swaps of adjacent constituents are lest costly and thus more likely. Here we investigate the principle in the context of the triple formed by subject (S), object (O) and verb (V). We introduce the concept of word order rotation as a cognitive underpinning of that prediction. When the canonical order of a language is SOV, the principle predicts SOV < SVO, OSV < VSO, OVS < VOS, in order of increasing cognitive cost. We test the prediction in three flexible order SOV languages: Korean (Koreanic), Malayalam (Dravidian), and Sinhalese (Indo-European). Evidence of swap distance minimization is found in all three languages, but it is weaker in Sinhalese. Swap distance minimization is stronger than a preference for the canonical order in Korean and especially Malayalam.

View on arXivView PDF

Code Implementations

No confident code match yet

We couldn't find an author-owned or strongly-evidenced community implementation for this paper. Any repos shown below are weak matches — verify before relying on them.

No code implementations found yet.

Know of an implementation? Let us know in the comments below!

Similar Papers

Swap distance minimization beyond entropy minimization in word order variation

89% match2024

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

83% match2026

A bounded rationality account of dependency length minimization in Hindi

81% match2023

The optimal placement of the head in the noun phrase. The case of demonstrative, numeral, adjective and noun

80% match2024

A Cross-Linguistic Pressure for Uniform Information Density in Word Order

80% match1 repo62023

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

78% match2024

Cite this paper

@article{ferrericancho2023swap,
  title  = {Swap distance minimization in SOV languages. Cognitive and mathematical foundations},
  author = {Ramon Ferrer-i-Cancho and Savithry Namboodiripad},
  year   = {2023},
  eprint = {2312.04219},
  archivePrefix = {arXiv},
  url    = {http://arxiv.org/abs/2312.04219v1}
}

Add a badge to your README

Shows whether official code is linked for this paper.

Code of Paper badge
[![Code of Paper](https://codeofpaper.com/badge/2312.04219.svg)](https://codeofpaper.com/paper/2312.04219)

Discussion