English
Related papers

Related papers: How (Non-)Optimal is the Lexicon?

200 papers

Zipf's law of abbreviation, namely the tendency of more frequent words to be shorter, has been viewed as a manifestation of compression, i.e. the minimization of the length of forms -- a universal principle of natural communication.…

Computation and Language · Computer Science 2026-03-31 Sonia Petrini , Antoni Casas-i-Muñoz , Jordi Cluet-i-Martinell , Mengxue Wang , Christian Bentz , Ramon Ferrer-i-Cancho

Zipf's law of abbreviation, the tendency of more frequent words to be shorter, is one of the most solid candidates for a linguistic universal, in the sense that it has the potential for being exceptionless or with a number of exceptions…

Computation and Language · Computer Science 2023-10-13 Sonia Petrini , Antoni Casas-i-Muñoz , Jordi Cluet-i-Martinell , Mengxue Wang , Chris Bentz , Ramon Ferrer-i-Cancho

Statistical regularities in human language have fascinated researchers for decades, suggesting deep underlying principles governing its evolution and information structuring for efficient communication. While Zipf's Law describes the…

Physics and Society · Physics 2025-04-29 Alessandro Bellina , Vito D. P. Servedio

The problem of compression in standard information theory consists of assigning codes as short as possible to numbers. Here we consider the problem of optimal coding -- under an arbitrary coding scheme -- and show that it predicts Zipf's…

Computation and Language · Computer Science 2020-09-24 Ramon Ferrer-i-Cancho , Christian Bentz , Caio Seguin

Languages across the world exhibit Zipf's law of abbreviation, namely more frequent words tend to be shorter. The generalized version of the law - an inverse relationship between the frequency of a unit and its magnitude - holds also for…

Information Theory · Computer Science 2016-05-05 R. Ferrer-i-Cancho , C. Bentz , C. Seguin

Quantitative linguistics has provided us with a number of empirical laws that characterise the evolution of languages and competition amongst them. In terms of language usage, one of the most influential results is Zipf's law of word…

Physics and Society · Physics 2009-01-21 Alvaro Corral , Ramon Ferrer-i-Cancho , Gemma Boleda , Albert Diaz-Guilera , .

The Zipf's law is the major regularity of statistical linguistics that served as a prototype for rank-frequency relations and scaling laws in natural sciences. Here we show that the Zipf's law -- together with its applicability for a single…

Data Analysis, Statistics and Probability · Physics 2015-06-15 Armen E. Allahverdyan , Weibing Deng , Q. A. Wang

We study a deliberately simple, fully non-linguistic model of text: a sequence of independent draws from a finite alphabet of letters plus a single space symbol. A word is defined as a maximal block of non-space symbols. Within this…

Computation and Language · Computer Science 2025-11-25 Vladimir Berman

Zipf's law has been found in many human-related fields, including language, where the frequency of a word is persistently found as a power law function of its frequency rank, known as Zipf's law. However, there is much dispute whether it is…

Computation and Language · Computer Science 2018-07-06 Shuiyuan Yu , Chunshan Xu , Haitao Liu

Zipf's law is a fundamental paradigm in the statistics of written and spoken natural language as well as in other communication systems. We raise the question of the elementary units for which Zipf's law should hold in the most natural way,…

Physics and Society · Physics 2015-07-14 Alvaro Corral , Gemma Boleda , Ramon Ferrer-i-Cancho

According to Zipf's meaning-frequency law, words that are more frequent tend to have more meanings. Here it is shown that a linear dependency between the frequency of a form and its number of meanings is found in a family of models of…

Computation and Language · Computer Science 2016-10-14 Ramon Ferrer-i-Cancho

Natural languages are full of rules and exceptions. One of the most famous quantitative rules is Zipf's law which states that the frequency of occurrence of a word is approximately inversely proportional to its rank. Though this `law' of…

Computation and Language · Computer Science 2015-05-27 Jake Ryland Williams , James P. Bagrow , Christopher M. Danforth , Peter Sheridan Dodds

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…

Computation and Language · Computer Science 2020-09-24 Ramon Ferrer-i-Cancho

Languages vary widely in how meanings map to word forms. These mappings have been found to support efficient communication; however, this theory does not account for systematic relations within word forms. We examine how a restricted set of…

Computation and Language · Computer Science 2026-01-27 Doreen Osmelak , Yang Xu , Michael Hahn , Kate McCurdy

In the setting of minimal local grammar-based coding, the input string is represented as a grammar with the minimal output length defined via simple symbol-by-symbol encoding. This paper discusses four contributions to this field. First, we…

Information Theory · Computer Science 2025-04-17 Łukasz Dębowski

Human language, the most powerful communication system in history, is closely associated with cognition. Written text is one of the fundamental manifestations of language, and the study of its universal regularities can give clues about how…

Computation and Language · Computer Science 2009-02-05 M. Angeles Serrano , Alessandro Flammini , Filippo Menczer

The avoidability, or unavoidability of patterns in words over finite alphabets has been studied extensively. A word (pattern) over a finite set is said to be unavoidable if, for all but finitely many words, there exists a morphism mapping…

Formal Languages and Automata Theory · Computer Science 2019-07-16 Paul Sauer

The inverse relationship between the length of a word and the frequency of its use, first identified by G.K. Zipf in 1935, is a classic empirical law that holds across a wide range of human languages. We demonstrate that length is one…

Computation and Language · Computer Science 2017-06-02 Stephan C. Meylan , Thomas L. Griffiths

With Zipf's law being originally and most famously observed for word frequency, it is surprisingly limited in its applicability to human language, holding over no more than three to four orders of magnitude before hitting a clear break in…

Computation and Language · Computer Science 2015-03-05 Jake Ryland Williams , Paul R. Lessard , Suma Desu , Eric Clark , James P. Bagrow , Christopher M. Danforth , Peter Sheridan Dodds

Color naming in natural languages is not arbitrary: it reflects efficient partitions of perceptual color space modulated by the relative needs to communicate about different colors. These psychophysical and communicative constraints help…

Populations and Evolution · Quantitative Biology 2023-05-09 Colin R. Twomey , David H. Brainard , Joshua B. Plotkin
‹ Prev 1 2 3 10 Next ›