A surprisal–duration trade-off across and within the world's languages

09/30/2021
by   Tiago Pimentel, et al.
0

While there exist scores of natural languages, each with its unique features and idiosyncrasies, they all share a unifying theme: enabling human communication. We may thus reasonably predict that human cognition shapes how these languages evolve and are used. Assuming that the capacity to process information is roughly constant across human populations, we expect a surprisal–duration trade-off to arise both across and within languages. We analyse this trade-off using a corpus of 600 languages and, after controlling for several potential confounds, we find strong supporting evidence in both settings. Specifically, we find that, on average, phones are produced faster in languages where they are less surprising, and vice versa. Further, we confirm that more surprising phones are longer, on average, in 319 languages out of the 600. We thus conclude that there is strong evidence of a surprisal–duration trade-off in operation, both across and within the world's languages.

READ FULL TEXT

page 12

page 13

page 14

research
08/11/2016

The statistical trade-off between word order and word structure - large-scale evidence for the principle of least effort

Languages employ different strategies to transmit structural and grammat...
research
01/12/2018

Clinical and Non-clinical Effects on Surgery Duration: Statistical Modeling and Analysis

Surgery duration is usually used as an input to the operation room (OR) ...
research
06/10/2018

Are All Languages Equally Hard to Language-Model?

For general modeling methods applied to diverse languages, a natural que...
research
08/09/2018

Efficient human-like semantic representations via the Information Bottleneck principle

Maintaining efficient semantic representations of the environment is a m...
research
02/16/2019

Exploring Language Similarities with Dimensionality Reduction Technique

In recent years several novel models were developed to process natural l...
research
07/19/2023

On the work of dynamic constant-time parallel algorithms for regular tree languages and context-free languages

Previous work on Dynamic Complexity has established that there exist dyn...

Please sign up or login with your details

Forgot password? Click here to reset