activity
20152022
most citedOptimal coding and the origins of Zipfian laws

89 citations · 117 across the 5 of their papers we have counts for

collaborators

5 papers

cs.CL2022★ 3 cited

The optimality of word lengths. Theoretical foundations and an empirical study

Sonia Petrini, Antoni Casas-i-Muñoz, Jordi Cluet-i-Martinell +3

Zipf's law of abbreviation, namely the tendency of more frequent words to be shorter, has been viewed as a manifestation of compression, i.e. the minimization of the length of form…

cs.CL2019★ 89 cited

Optimal coding and the origins of Zipfian laws

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

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 ar…

cs.CL2017

Fast calculation of entropy with Zhang's estimator

Antoni Lozano, Bernardino Casas, Chris Bentz +1

Entropy is a fundamental property of a repertoire. Here, we present an efficient algorithm to estimate the entropy of types with the help of Zhang's estimator. The algorithm takes…

cs.CL2016★ 16 cited

The word entropy of natural languages

Christian Bentz, Dimitrios Alikaniotis

The average uncertainty associated with words is an information-theoretic concept at the heart of quantitative and computational linguistics. The entropy has been established as a…

cs.IT2015★ 9 cited

Compression and the origins of Zipf's law of abbreviation

R. Ferrer-i-Cancho, C. Bentz, C. Seguin

Languages across the world exhibit Zipf's law of abbreviation, namely more frequent words tend to be shorter. The generalized version of the law - an inverse relationship between t…