arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 1906.01545cs.CLcs.ITmath.ITphysics.soc-ph
收藏

最佳编码和齐普菲定律的起源

Optimal coding and the origins of Zipfian laws

cs.upc.edu(cs.upc.edu(该部分为邮箱域名,非独立机构))

Ramon Ferrer-i-Cancho, Christian Bentz, Caio Seguin

摘要:

标准信息论中的压缩问题包括给数字分配尽可能短的代码。在这里,我们考虑的问题,最佳编码-在任意的编码方案-并表明,它预测齐普夫定律的缩写,即在自然语言的趋势,更频繁的话要短。我们应用这一结果调查最佳编码下也被称为非奇异编码,一个计划,其中唯一的分割是没有保证,但代码代表一个不同的数字。最佳非奇异编码预测,一个词的长度应该增长约为对数的频率等级,这是再次符合齐普夫定律的缩写。结合最大熵原理的最佳非奇异编码也预测了Zipf的秩-频率分布。此外,我们对最佳非奇异编码的研究结果挑战了关于随机类型的常见信念。事实证明,随机输入实际上是一种最佳编码过程,与通常的假设形成鲜明对比,即它与成本削减的考虑无关。最后,我们讨论了最佳编码的影响,为建设一个紧凑的理论Zipfian法律和其他语言的法律。

英文摘要:

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 law of abbreviation, namely a tendency in natural languages for more frequent words to be shorter. We apply this result to investigate optimal coding also under so-called non-singular coding, a scheme where unique segmentation is not warranted but codes stand for a distinct number. Optimal non-singular coding predicts that the length of a word should grow approximately as the logarithm of its frequency rank, which is again consistent with Zipf's law of abbreviation. Optimal non-singular coding in combination with the maximum entropy principle also predicts Zipf's rank-frequency distribution. Furthermore, our findings on optimal non-singular coding challenge common beliefs about random typing. It turns out that random typing is in fact an optimal coding process, in stark contrast with the common assumption that it is detached from cost cutting considerations. Finally, we discuss the implications of optimal coding for the construction of a compact theory of Zipfian laws and other linguistic laws.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑