Zipf's law of abbreviation as a language universal

Christian Bentz, Ramon Ferrer-i-Cancho, 2016. Proceedings of the Leiden Workshop on Capturing Phylogenetic Algorithms for Linguistics.

Tests Zipf's law of abbreviation, the tendency of frequent words to be short, across a large sample of languages and argues that it holds universally.

Voynich ManuscriptArticleChecked against the original0

What it's used for here

Listed among the sources checked in the bioinformatics and signal-processing survey.

Cited by on this site 1 record

1 methods surveys

Signal processing

SRC

Cite it

Bentz, C., & Ferrer-i-Cancho, R. (2016). Zipf's law of abbreviation as a language universal. Proceedings of the Leiden Workshop on Capturing Phylogenetic Algorithms for Linguistics. https://publikationen.uni-tuebingen.de/xmlui/handle/10900/68639

@article{bentz2016zipfs,
  author = {Bentz, Christian and Ferrer-i-Cancho, Ramon},
  title = {Zipf's law of abbreviation as a language universal},
  journal = {Proceedings of the Leiden Workshop on Capturing Phylogenetic Algorithms for Linguistics},
  year = {2016},
  url = {https://publikationen.uni-tuebingen.de/xmlui/handle/10900/68639}
}

TY  - JOUR
TI  - Zipf's law of abbreviation as a language universal
AU  - Bentz, Christian
AU  - Ferrer-i-Cancho, Ramon
PY  - 2016
JO  - Proceedings of the Leiden Workshop on Capturing Phylogenetic Algorithms for Linguistics
UR  - https://publikationen.uni-tuebingen.de/xmlui/handle/10900/68639
ER  -

Bentz, Christian and Ramon Ferrer-i-Cancho. “Zipf's law of abbreviation as a language universal.” Proceedings of the Leiden Workshop on Capturing Phylogenetic Algorithms for Linguistics (2016).