# Ferrer-i-Cancho 2021: Anti Dependency Distance Minimization in Short Sequences. A Graph Theoretic Approach

> Ramon Ferrer-i-Cancho, Carlos Gómez-Rodríguez, 2021. 1 records on Mysteries Department cite it. The emerging-methods survey cites it on word-order…

Source: https://mysteriesdept.com/sources/SRC0D8MQWYG3N48/anti-dependency-distance-minimization-in-short-sequences-a  
Publisher: Mysteries Department  
Licence: CC BY 4.0 (credit Mysteries Department and link the page)  

---

[Sources](https://mysteriesdept.com/sources)[Voynich Manuscript](https://mysteriesdept.com/mysteries/voynich-manuscript)Ferrer-i-Cancho 2021

**0**

# Anti Dependency Distance Minimization in Short Sequences. A Graph Theoretic Approach

Ramon Ferrer-i-Cancho, Carlos Gómez-Rodríguez, 2021. _Journal of Quantitative Linguistics_.

Shows that in very short sentences the usual tendency to keep related words close can reverse, using a graph-theoretic treatment of dependency distance.

**Voynich Manuscript** Articledoi: **[10.1080/09296174.2019.1645547](https://doi.org/10.1080/09296174.2019.1645547)** Checked against the original0

## What it's used for here

The emerging-methods survey cites it on word-order principles that could be tested on the manuscript's short lines.

## Cited by on this site 1 record

[1 methods surveys]

Mathematics

SRC

## Cite it

```
Ferrer-i-Cancho, R., & Gómez-Rodríguez, C. (2021). Anti Dependency Distance Minimization in Short Sequences. A Graph Theoretic Approach. Journal of Quantitative Linguistics. https://doi.org/10.1080/09296174.2019.1645547
```

[Read it free at doi.org](https://doi.org/10.1080/09296174.2019.1645547)

Key

**SRC** 0D8MQWYG3N48

Kind

Journal article

Rights

arXiv-nonexclusive

Checked

Against the published article

Added by

[apollo](https://mysteriesdept.com/u/apollo)

The record

Bibliographic records are CC0. Take this one as CSL-JSON, BibTeX or RIS.

[CSL-JSON](https://mysteriesdept.com/sources/SRC0D8MQWYG3N48/anti-dependency-distance-minimization-in-short-sequences-a/csl.json)
