中文
相关论文

相关论文: Revisiting the Optimality of Word Lengths

200 篇论文

We study the cost-minimization problem posed by Ferrer i Cancho and Sol\'e in their model of communication that aimed at explaining the origin of Zipf's law [PNAS 100, 788 (2003)]. Direct analysis shows that the minimum cost is $\min…

统计力学 · 物理学 2013-04-09 Ronald Dickman , Nicholas R. Moloney , Eduardo G. Altmann

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 forms -- a universal principle of natural communication.…

Zipf's law of abbreviation, the tendency of more frequent words to be shorter, is one of the most solid candidates for a linguistic universal, in the sense that it has the potential for being exceptionless or with a number of exceptions…

The inverse relationship between the length of a word and the frequency of its use, first identified by G.K. Zipf in 1935, is a classic empirical law that holds across a wide range of human languages. We demonstrate that length is one…

计算与语言 · 计算机科学 2017-06-02 Stephan C. Meylan , Thomas L. Griffiths

Statistical regularities in human language have fascinated researchers for decades, suggesting deep underlying principles governing its evolution and information structuring for efficient communication. While Zipf's Law describes the…

物理与社会 · 物理学 2025-04-29 Alessandro Bellina , Vito D. P. Servedio

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 the frequency of a unit and its magnitude - holds also for…

信息论 · 计算机科学 2016-05-05 R. Ferrer-i-Cancho , C. Bentz , C. Seguin

It is often stated that human languages, as other biological systems, are shaped by cost-cutting pressures but, to what extent? Attempts to quantify the degree of optimality of languages by means of an optimality score have been scarce and…

计算与语言 · 计算机科学 2022-05-11 Ramon Ferrer-i-Cancho , Carlos Gómez-Rodríguez , Juan Luis Esteban , Lluís Alemany-Puig

Recently, Ferrer i Cancho and Moscoso del Prado Martin [arXiv:1209.1751] argued that an observed linear relationship between word length and average surprisal (Piantadosi, Tily, & Gibson, 2011) is not evidence for communicative efficiency…

计算与语言 · 计算机科学 2013-07-26 Steven T. Piantadosi , Harry Tily , Edward Gibson

Zipf's law is a fundamental paradigm in the statistics of written and spoken natural language as well as in other communication systems. We raise the question of the elementary units for which Zipf's law should hold in the most natural way,…

物理与社会 · 物理学 2015-07-14 Alvaro Corral , Gemma Boleda , Ramon Ferrer-i-Cancho

We study a deliberately simple, fully non-linguistic model of text: a sequence of independent draws from a finite alphabet of letters plus a single space symbol. A word is defined as a maximal block of non-space symbols. Within this…

计算与语言 · 计算机科学 2025-11-25 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:…

物理与社会 · 物理学 2020-09-24 Ramon Ferrer-i-Cancho

How predictable a word is can be quantified in two ways: using human responses to the cloze task or using probabilities from language models (LMs).When used as predictors of processing effort, LM probabilities outperform probabilities…

计算与语言 · 计算机科学 2026-05-27 Sathvik Nair , Byung-Doh Oh

Ferrer-i-Cancho (2015) presents a mathematical model of both the synchronic and diachronic nature of word order based on the assumption that memory costs are a never decreasing function of distance and a few very general linguistic…

计算与语言 · 计算机科学 2014-08-21 Phillip M. Alday

We present an impossibility result, called a theorem about facts and words, which pertains to a general communication system. The theorem states that the number of distinct words used in a finite text is roughly greater than the number of…

信息论 · 计算机科学 2022-11-03 Łukasz Dębowski

Here we sketch a new derivation of Zipf's law for word frequencies based on optimal coding. The structure of the derivation is reminiscent of Mandelbrot's random typing model but it has multiple advantages over random typing: (1) it starts…

计算与语言 · 计算机科学 2020-09-24 Ramon Ferrer-i-Cancho

Despite renewed interest in emergent language simulations with neural networks, little is known about the basic properties of the induced code, and how they compare to human language. One fundamental characteristic of the latter, known as…

计算与语言 · 计算机科学 2019-10-16 Rahma Chaabouni , Eugene Kharitonov , Emmanuel Dupoux , Marco Baroni

Performance assessment and optimization for networks jointly performing caching, computing, and communication (3C) has recently drawn significant attention because many emerging applications require 3C functionality. However, studies in the…

信息论 · 计算机科学 2022-06-09 Ming-Chun Lee , Andreas F. Molisch

Recently, it has been claimed that a linear relationship between a measure of information content and word length is expected from word length optimization and it has been shown that this linearity is supported by a strong correlation…

数据分析、统计与概率 · 物理学 2019-12-11 Ramon Ferrer-i-Cancho , Fermín Moscoso del Prado Martín

According to Zipf's meaning-frequency law, words that are more frequent tend to have more meanings. Here it is shown that a linear dependency between the frequency of a form and its number of meanings is found in a family of models of…

计算与语言 · 计算机科学 2016-10-14 Ramon Ferrer-i-Cancho

The Uniform Information Density (UID) hypothesis posits that speakers tend to distribute information evenly across linguistic units to achieve efficient communication. Of course, information rate in texts and discourses is not perfectly…

计算与语言 · 计算机科学 2024-10-22 Eleftheria Tsipidi , Franz Nowak , Ryan Cotterell , Ethan Wilcox , Mario Giulianelli , Alex Warstadt
‹ 上一页 1 2 3 10 下一页 ›