Skip to main content
We gratefully acknowledge support from the Simons Foundation, member institutions, and all contributors. Donate
arXiv logo
Cornell University Logo

Computer Science > Computation and Language

arXiv:1605.01326 (cs)
[Submitted on 4 May 2016 (v1), last revised 20 Jul 2016 (this version, v2)]

Title:Compression and the origins of Zipf's law for word frequencies

Authors:Ramon Ferrer-i-Cancho
View PDF
Abstract:Here we sketch a new derivation of Zipf's law for word frequencies based on optimal coding. The structure of the derivation is reminiscent of Mandelbrot's random typing model but it has multiple advantages over random typing: (1) it starts from realistic cognitive pressures (2) it does not require fine tuning of parameters and (3) it sheds light on the origins of other statistical laws of language and thus can lead to a compact theory of linguistic laws. Our findings suggest that the recurrence of Zipf's law in human languages could originate from pressure for easy and fast communication.
Comments: arguments have been improved; in press in Complexity (Wiley)
Subjects: Computation and Language (cs.CL); Data Analysis, Statistics and Probability (physics.data-an); Physics and Society (physics.soc-ph); Neurons and Cognition (q-bio.NC)
Cite as: arXiv:1605.01326 [cs.CL]
  (or arXiv:1605.01326v2 [cs.CL] for this version)
  https://doi.org/10.48550/arXiv.1605.01326
Journal reference: Complexity 21, 409-411 (2016)
Related DOI: https://doi.org/10.1002/cplx.21820

Submission history

From: Ramon Ferrer i Cancho [view email]
[v1] Wed, 4 May 2016 16:00:59 UTC (5 KB)
[v2] Wed, 20 Jul 2016 15:14:10 UTC (6 KB)
Full-text links:

Access Paper:

view license
Current browse context:
cs.CL
< prev   |   next >
new | recent | 2016-05
Change to browse by:
cs
physics
physics.data-an
physics.soc-ph
q-bio
q-bio.NC

References & Citations

DBLP - CS Bibliography

listing | bibtex
Ramon Ferrer-i-Cancho
export BibTeX citation

Bookmark

BibSonomy logo Reddit logo

Bibliographic and Citation Tools

Bibliographic Explorer (What is the Explorer?)
Connected Papers (What is Connected Papers?)
Litmaps (What is Litmaps?)
scite Smart Citations (What are Smart Citations?)

Code, Data and Media Associated with this Article

alphaXiv (What is alphaXiv?)
CatalyzeX Code Finder for Papers (What is CatalyzeX?)
DagsHub (What is DagsHub?)
Gotit.pub (What is GotitPub?)
Hugging Face (What is Huggingface?)
Papers with Code (What is Papers with Code?)
ScienceCast (What is ScienceCast?)

Demos

Replicate (What is Replicate?)
Hugging Face Spaces (What is Spaces?)
TXYZ.AI (What is TXYZ.AI?)

Recommenders and Search Tools

Influence Flower (What are Influence Flowers?)
CORE Recommender (What is CORE?)

arXivLabs: experimental projects with community collaborators

arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website.

Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them.

Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs.

Which authors of this paper are endorsers? | Disable MathJax (What is MathJax?)