Salge Christoph, Ay Nihat, Polani Daniel, Prokopenko Mikhail
Department of Computer Science, University of Hertfordshire, Hatfield, United Kingdom.
Max Planck Institute for Mathematics in the Sciences, Leipzig, Germany; Santa Fe Institute, Santa Fe, United States of America; Department of Mathematics and Computer Science, Leipzig University, Leipzig, Germany.
PLoS One. 2015 Oct 1;10(10):e0139475. doi: 10.1371/journal.pone.0139475. eCollection 2015.
We propose a model that explains the reliable emergence of power laws (e.g., Zipf's law) during the development of different human languages. The model incorporates the principle of least effort in communications, minimizing a combination of the information-theoretic communication inefficiency and direct signal cost. We prove a general relationship, for all optimal languages, between the signal cost distribution and the resulting distribution of signals. Zipf's law then emerges for logarithmic signal cost distributions, which is the cost distribution expected for words constructed from letters or phonemes.
我们提出了一个模型,该模型解释了不同人类语言发展过程中幂律(例如齐普夫定律)可靠出现的现象。该模型纳入了通信中最小努力原则,将信息论通信效率低下与直接信号成本的组合降至最低。我们证明了对于所有最优语言,信号成本分布与最终信号分布之间的一般关系。对于对数信号成本分布,齐普夫定律随之出现,而对数信号成本分布是由字母或音素构成的单词所预期的成本分布。