English
Related papers

Related papers: How (Non-)Optimal is the Lexicon?

200 papers

The pioneering research of G. K. Zipf on the relationship between word frequency and other word features led to the formulation of various linguistic laws. The most popular is Zipf's law for word frequencies. Here we focus on two laws that…

Computation and Language · Computer Science 2020-09-24 Bernardino Casas , Antoni Hernández-Fernández , Neus Català , Ramon Ferrer-i-Cancho , Jaume Baixeries

Tokenization is a fundamental step in natural language processing (NLP) and other sequence modeling domains, where the choice of vocabulary size significantly impacts model performance. Despite its importance, selecting an optimal…

Machine Learning · Computer Science 2025-07-31 Yanjin He , Qingkai Zeng , Meng Jiang

Linguistic evaluations of how well LMs generalize to produce or understand language often implicitly take for granted that natural languages are generated by symbolic rules. According to this perspective, grammaticality is determined by…

Computation and Language · Computer Science 2025-09-19 Leonie Weissweiler , Kyle Mahowald , Adele Goldberg

The disparity in the languages commonly studied in Natural Language Processing (NLP) is typically reflected by referring to languages as low vs high-resourced. However, there is limited consensus on what exactly qualifies as a `low-resource…

Computation and Language · Computer Science 2024-10-29 Hellina Hailu Nigatu , Atnafu Lambebo Tonja , Benjamin Rosman , Thamar Solorio , Monojit Choudhury

One of the ultimate goals for linguists is to find universal properties in human languages. Although words are generally considered as representing arbitrary mapping between linguistic forms and meanings, we propose a new universal law that…

Computation and Language · Computer Science 2020-05-06 Li-Min Wang , Sun-Ting Tsai , Shan-Jyun Wu , Meng-Xue Tsai , Daw-Wei Wang , Yi-Ching Su , Tzay-Ming Hong

Morphological tasks use large multi-lingual datasets that organize words into inflection tables, which then serve as training and evaluation data for various tasks. However, a closer inspection of these data reveals profound…

Computation and Language · Computer Science 2022-10-20 Omer Goldman , Reut Tsarfaty

The Zipf's law establishes that if the words of a (large) text are ordered by decreasing frequency, the frequency versus the rank decreases as a power law with exponent close to $-1$. Previous work has stressed that this pattern arises from…

Physics and Society · Physics 2019-04-03 Felipe Urbina , Javier Vera

Dependency syntax represents the structure of a sentence as a tree composed of dependencies, i.e., directed relations between lexical units. While in its more general form any such tree is allowed, in practice many are not plausible or are…

Computation and Language · Computer Science 2026-04-07 Gómez-Rodríguez , Carlos , Alemany-Puig , Lluís

Despite being a paradigm of quantitative linguistics, Zipf's law for words suffers from three main problems: its formulation is ambiguous, its validity has not been tested rigorously from a statistical point of view, and it has not been…

Applications · Statistics 2016-02-17 Isabel Moreno-Sánchez , Francesc Font-Clos , Álvaro Corral

As NLP tools become ubiquitous in today's technological landscape, they are increasingly applied to languages with a variety of typological structures. However, NLP research does not focus primarily on typological differences in its…

Computation and Language · Computer Science 2020-05-04 Sophie Groenwold , Samhita Honnavalli , Lily Ou , Aesha Parekh , Sharon Levy , Diba Mirza , William Yang Wang

It has been claimed that within a language, morphologically irregular words are more likely to be phonotactically simple and morphologically regular words are more likely to be phonotactically complex. This inverse correlation has been…

Computation and Language · Computer Science 2024-06-11 Amanda Doucette , Ryan Cotterell , Morgan Sonderegger , Timothy J. O'Donnell

Owing to their reasoning capabilities, large language models (LLMs) have been evaluated on planning tasks described in natural language. However, LLMs have largely been tested on planning domains without constraints. In order to deploy them…

Computation and Language · Computer Science 2025-10-08 Periklis Mantenoglou , Rishi Hazra , Pedro Zuidberg Dos Martires , Luc De Raedt

Logic languages based on the theory of rational, possibly infinite, trees have much appeal in that rational trees allow for faster unification (due to the safe omission of the occurs-check) and increased expressivity (cyclic terms can…

Programming Languages · Computer Science 2007-05-23 Roberto Bagnara , Roberta Gori , Patricia M. Hill , Enea Zaffanella

As is the case of many signals produced by complex systems, language presents a statistical structure that is balanced between order and disorder. Here we review and extend recent results from quantitative characterisations of the degree of…

Computation and Language · Computer Science 2015-03-05 Marcelo A Montemurro , Damián H Zanette

Lexical ambiguity is widespread in language, allowing for the reuse of economical word forms and therefore making language more efficient. If ambiguous words cannot be disambiguated from context, however, this gain in efficiency might make…

Computation and Language · Computer Science 2024-05-29 Tiago Pimentel , Rowan Hall Maudslay , Damián Blasi , Ryan Cotterell

In today's multilingual lexical databases, the majority of the world's languages are under-represented. Beyond a mere issue of resource incompleteness, we show that existing lexical databases have structural limitations that result in a…

Computation and Language · Computer Science 2023-01-24 Fausto Giunchiglia , Gabor Bella , Nandu Chandran Nair , Yang Chi , Hao Xu

The height of a piecewise-testable language $L$ is the maximum length of the words needed to define $L$ by excluding and requiring given subwords. The height of $L$ is an important descriptive complexity measure that has not yet been…

Logic in Computer Science · Computer Science 2023-06-22 Prateek Karandikar , Philippe Schnoebelen

Human language has a distinct systematic structure, where utterances break into individually meaningful words which are combined to form phrases. We show that natural-language-like systematicity arises in codes that are constrained by a…

Computation and Language · Computer Science 2025-11-19 Richard Futrell , Michael Hahn

We present a simple structure based model of how words are formed from morphemes. The model explains two major empirical facts: the typical distribution of word lengths and the appearance of Zipf like rank frequency curves. In contrast to…

Methodology · Statistics 2025-12-16 Vladimir Berman

A family of information theoretic models of communication was introduced more than a decade ago to explain the origins of Zipf's law for word frequencies. The family is a based on a combination of two information theoretic principles:…

Physics and Society · Physics 2020-09-24 Ramon Ferrer-i-Cancho