Similarity of symbol frequency distributions with heavy tails
Martin Gerlach, Francesc Font-Clos, Eduardo G. Altmann

TL;DR
This paper analyzes how heavy-tailed symbol frequency distributions affect the accuracy of similarity measures between sequences, providing analytical insights and practical applications to language evolution.
Contribution
It offers a theoretical framework for understanding errors in entropy-based similarity measures for heavy-tailed distributions and demonstrates its application to language change analysis.
Findings
Errors decay slower than 1/N for small alpha
For alpha > alpha* = 1+1/gamma, errors decay as 1/N
Language evolution shows slower change in frequent words
Abstract
Quantifying the similarity between symbolic sequences is a traditional problem in Information Theory which requires comparing the frequencies of symbols in different sequences. In numerous modern applications, ranging from DNA over music to texts, the distribution of symbol frequencies is characterized by heavy-tailed distributions (e.g., Zipf's law). The large number of low-frequency symbols in these distributions poses major difficulties to the estimation of the similarity between sequences, e.g., they hinder an accurate finite-size estimation of entropies. Here we show analytically how the systematic (bias) and statistical (fluctuations) errors in these estimations depend on the sample size~ and on the exponent~ of the heavy-tailed distribution. Our results are valid for the Shannon entropy , its corresponding similarity measures (e.g., the Jensen-Shanon…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
