Zipf's law
Encyclopedia : Z : ZI : ZIP : Zipf's law
]| cdf =[\frac}}]| mean =[\frac}}]| median =N/A| mode =[\frac}]| variance =| skewness =| kurtosis =| entropy =[\frac}\sum_^N\frac+\ln(H_)]| mgf =[\frac}\sum_^N \frac}]| char =[\frac}\sum_^N \frac}]| }} Originally, Zipf's law stated that, in a corpus of natural language utterances, the frequency of any word is roughly inversely proportional to its rank in the frequency table. So, the most frequent word will occur approximately twice as often as the second most frequent word, which occurs twice as often as the fourth most frequent word, etc. The term has come to be used to refer to any of a family of related power law probability distributions.
The "law" was publicized by Harvard linguist George Kingsley Zipf (IPA [zɪf]).
For example, in the Brown Corpus "the" is the most frequently-occurring word, and all by itself accounts for nearly 7% of all word occurrences (69971 out of slightly over 1 million). True to Zipf's Law, the second-place word "of" accounts for slightly over 3.5% of words (36411 occurrences), followed by "and" (28852). Only 135 vocabulary items are needed to account for half the Brown Corpus.
Zipf's law is thus an experimental law, not a theoretical one. Zipfian distributions are commonly observed, in many kinds of phenomena. The causes of Zipfian distributions in real life are a matter of some controversy, however.
Zipf's law is most easily observed by scatterplotting the data, with the axes being log(rank order) and log(frequency). For example, "the" as described above would appear at x = log(1), y = log(69971). If the points are close to a single straight line, the distribution follows Zipf's law.
The simplest case of Zipf's law is a "1/f function". Given a set of Zipfian distributed frequencies, sorted from most common to least common, the second most common frequency will occur 1/2 as often as the first. The third most common frequency will occur 1/3 as often as the first. The nth most common frequency will occur 1/n as often as the first. However, this cannot hold precisely true, because items must occur an integer number of times: there cannot be 2.5 occurrences of a word. Nevertheless, over fairly wide ranges, and to a fairly good approximation, many natural phenomena obey Zipf's Law.
Theoretical issues
Zipf's law may be stated mathematically as:
- [f(k;s,N)=\frac^N 1/n^s}]
- [\sum_^N f(k;N,s)=1.]
- [f(k;N,s)=\frac}]
Mathematically, it is impossible for the classic version of Zipf's law to hold exactly if there are infinitely many words in a language, since the sum of all relative frequencies in the denominator above is equal to the harmonic series and therefore:
- [\sum_^\infty \frac=\infty\!]
As long as the exponent s exceeds 1, it is possible for such a law to hold with infinitely many words, since if s > 1 then
- [\zeta (s) = \sum_^\infty \frac<\infty. \!]
Related laws
The term Zipf's law has come more generally to refer to frequency distributions of "rank data" in which the relative frequency of the nth-ranked item is given by the Zeta distribution, 1/(nsζ(s)), where s > 1 is a parameter indexing this family of probability distributions. Indeed, the term Zipf's law sometimes simply means the zeta distribution, since probability distributions are sometimes called "laws". This distribution is sometimes called the Zipfian distribution or Yule distribution.A more general law proposed by Benoit Mandelbrot has frequencies
- [f(k;N,q,s)=[mbox]/(k+q)^s.\,]
In the tail of the Yule-Simon distribution the frequencies are approximately
- [f(k;\rho) \approx [mbox]/k^]
The log-normal distribution is the distribution of a random variable whose logarithm is normally distributed, useful when small fluctuations multiply a quantity rather than add to it.
In the parabolic fractal distribution, the logarithm of the frequency is a quadratic polynomial of the logarithm of the rank. This can markedly improve the fit over a simple power-law relationship (see external link below).
It has been pointed out (see external link below) that Zipfian distributions can also be regarded as being Pareto distributions with an exchange of variables.
It has been argued that Benford's law is a special case of Zipf's law. See [link] for a proof.
See also
- Benford's law
- Bradford's law
- Heaps' law
- Lorenz curve
- Lotka's law
- Mathematical economics
- Pareto distribution
- Pareto principle
- The Long Tail
- Voynich manuscript
- Zipf-Mandelbrot law
Further reading
- George K. Zipf, Human Behaviour and the Principle of Least-Effort, Addison-Wesley, Cambridge MA, 1949
- W. Li, "Random texts exhibit Zipf's-law-like word frequency distribution", IEEE Transactions on Information Theory, 38(6), pp.1842-1845, 1992.
- Alexander Gelbukh, Grigori Sidorov. ["Zipf and Heaps Laws’ Coefficients Depend on Language"]. Proc. CICLing-2001, Conference on Intelligent Text Processing and Computational Linguistics, February 18–24, 2001, Mexico City. Lecture Notes in Computer Science N 2004, ISSN 0302-9743, ISBN 3-540-41687-0, Springer-Verlag, pp. 332–335.
- Damian H. Zanette. Zipf's law and the creation of musical context. Online preprint at http://xxx.arxiv.org/abs/cs.CL/0406015
- Kali R. The city as a giant component: a random graph approach to Zipf's law. Applied Economics Letters, 15 September 2003, vol. 10, iss. 11, pp. 717-720(4)
External links
- [Comprehensive bibliography of Zipf's law]
- [Zipf Law, Zipf Distribution: An Introduction]
- [Zipf, Power-laws, and Pareto - a ranking tutorial]
- [Seeing Around Corners (Artificial societies turn up Zipf's law)]
- [PlanetMath article on Zipf's law]
- [Benford's Law and Zipf's Law, An Introduction] at cut-the-knot
- [Distributions de type “fractal parabolique” dans la Nature (French, with English summary)]
- [An analysis of income distribution]
- [Zipf List of French words]
- [Citations and the Zipf-Mandelbrot's law]
- [Use of Hermetic Word Frequency Counter to Illustrate Zipf's Law]
From Wikipedia, the Free Encyclopedia. Original article here. Support Wikipedia by contributing or donating.
All text is available under the terms of the GNU Free Documentation License See Wikipedia Copyrights for details.
