Revisiting the Optimality of Word Lengths
Not on the map. Why?
Abstract (arXiv)
Zipf (1935) posited that wordforms are optimized to minimize utterances' communicative costs. Under the assumption that cost is given by an utterance's length, he supported this claim by showing that words' lengths are inversely correlated with their frequencies. Communicative cost, however, can be operationalized in different ways. Piantadosi et al. (2011) claim that cost should be measured as the distance between an utterance's information rate and channel capacity, which we dub the channel capacity hypothesis (CCH) here. Following this logic, they then proposed that a word's length should be proportional to the expected value of its surprisal (negative log-probability in context). In this work, we show that Piantadosi et al.'s derivation does not minimize CCH's cost, but rather a lower bound, which we term CCH-lower. We propose a novel derivation, suggesting an improved way to minimize CCH's cost. Under this method, we find that a language's word lengths should instead be proportional to the surprisal's expectation plus its variance-to-mean ratio. Experimentally, we compare these three communicative cost functions: Zipf's, CCH-lower , and CCH. Across 13 languages and several experimental settings, we find that length is better predicted by frequency than either of the other hypotheses. In fact, when surprisal's expectation, or expectation plus variance-to-mean ratio, is estimated using better language models, it leads to worse word length predictions. We take these results as evidence that Zipf's longstanding hypothesis holds.
Key facts. Cited by 5 papers in the map (data through 7 Oct 2026). Builds on 8 of its 44 references that are in the map. First posted on arXiv 6 Dec 2023.
Builds on
8 of 44 references.
References · 8
- 2017Attention Is All You Needcited by 59,932
- 2014Adam: A Method for Stochastic Optimizationcited by 36,960
- 2019fairseq: A Fast, Extensible Toolkit for Sequence Modelingcited by 1,486
- 2018Subword Regularization: Improving Neural Network Translation Models with Multiple Subword Candidatescited by 632
- 2021Revisiting the Uniform Information Density Hypothesiscited by 63
- 2021A surprisal--duration trade-off across and within the world's languagescited by 22
- 2021How (Non-)Optimal is the Lexicon?cited by 11
- 2023Direct and indirect evidence of compression of word lengths. Zipf's law of abbreviation revisitedcited by 4
Built on by
Citing papers per year: 2024: 2; 2025: 2; 2026: 1.
5 papers.
- 2024How to Compute the Probability of a Wordcited by 36
- 2025Using Information Theory to Characterize Prosodic Typology: The Case of Tone, Pitch-Accent and Stress-Accentcited by 3
- 2025Strategic resource allocation in memory encoding: An efficiency principle shaping language processingcited by 2
- 2024Is Structure Dependence Shaped for Efficient Communication?: A Case Study on Coordinationcited by 1
- 2026SAMAS: A Spectrum-Guided Multi-Agent System for Achieving Style Fidelity in Literary Translationcited by 0
- 2026SAMAS: A Spectrum-Guided Multi-Agent System for Achieving Style Fidelity in Literary Translation23 Feb 2026
- 2025Using Information Theory to Characterize Prosodic Typology: The Case of Tone, Pitch-Accent and Stress-Accent12 May 2025
- 2025Strategic resource allocation in memory encoding: An efficiency principle shaping language processing18 Mar 2025
- 2024Is Structure Dependence Shaped for Efficient Communication?: A Case Study on Coordination14 Oct 2024
- 2024How to Compute the Probability of a Word20 Jun 2024