English
Related papers

Related papers: Non-crossing dependencies: least effort, not gramm…

200 papers

The syntactic structure of a sentence can be modeled as a tree where vertices are words and edges indicate syntactic dependencies between words. It is well-known that those edges normally do not cross when drawn over the sentence. Here a…

Computation and Language · Computer Science 2014-12-11 Ramon Ferrer-i-Cancho

The structure of a sentence can be represented as a network where vertices are words and edges indicate syntactic dependencies. Interestingly, crossing syntactic dependencies have been observed to be infrequent in human languages. This…

Computation and Language · Computer Science 2017-12-13 Carlos Gómez-Rodríguez , Ramon Ferrer-i-Cancho

The syntactic structure of sentences exhibits a striking regularity: dependencies tend to not cross when drawn above the sentence. We investigate two competing explanations. The traditional hypothesis is that this trend arises from an…

Computation and Language · Computer Science 2017-12-14 Ramon Ferrer-i-Cancho , Carlos Gómez-Rodríguez

The syntactic structure of a sentence can be modelled as a tree, where vertices correspond to words and edges indicate syntactic dependencies. It has been claimed recurrently that the number of edge crossings in real sentences is small.…

Physics and Society · Physics 2017-12-14 Ramon Ferrer-i-Cancho , Carlos Gomez-Rodriguez , J. L. Esteban

It has been hypothesized that the rather small number of crossings in real syntactic dependency trees is a side-effect of pressure for dependency length minimization. Here we answer a related important research question: what would be the…

Computation and Language · Computer Science 2017-05-09 Ramon Ferrer-i-Cancho

Mixing dependency lengths from sequences of different length is a common practice in language research. However, the empirical distribution of dependency lengths of sentences of the same length differs from that of sentences of varying…

Computation and Language · Computer Science 2014-12-03 Ramon Ferrer-i-Cancho , Haitao Liu

This paper hypothesizes that chunking plays important role in reducing dependency distance and dependency crossings. Computer simulations, when compared with natural languages,show that chunking reduces mean dependency distance (MDD) of a…

Computation and Language · Computer Science 2016-09-27 Qian Lu , Chunshan Xu , Haitao Liu

The syntactic structure of a sentence can be represented as a tree where edges indicate syntactic dependencies between words. When that structure is a star, it has been demonstrated that the head should be placed in the middle of the linear…

Computation and Language · Computer Science 2026-05-01 Emília Garcia-Casademont , Ramon Ferrer-i-Cancho

Dependency distance minimization (DDm) is a word order principle favouring the placement of syntactically related words close to each other in sentences. Massive evidence of the principle has been reported for more than a decade with the…

Computation and Language · Computer Science 2021-02-02 Ramon Ferrer-i-Cancho , Carlos Gómez-Rodríguez

Sequence-processing neural networks led to remarkable progress on many NLP tasks. As a consequence, there has been increasing interest in understanding to what extent they process language as humans do. We aim here to uncover which biases…

Computation and Language · Computer Science 2019-06-17 Rahma Chaabouni , Eugene Kharitonov , Alessandro Lazaric , Emmanuel Dupoux , Marco Baroni

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…

Computation and Language · Computer Science 2022-05-11 Ramon Ferrer-i-Cancho , Carlos Gómez-Rodríguez , Juan Luis Esteban , Lluís Alemany-Puig

Bayesian networks (BNs) are a probabilistic graphical model widely used for representing expert knowledge and reasoning under uncertainty. Traditionally, they are based on directed acyclic graphs that capture dependencies between random…

Artificial Intelligence · Computer Science 2023-01-23 Christel Baier , Clemens Dubslaff , Holger Hermanns , Nikolai Käfer

The word order of a sentence is shaped by multiple principles. The principle of syntactic dependency distance minimization is in conflict with the principle of surprisal minimization (or predictability maximization) in single head syntactic…

Computation and Language · Computer Science 2025-10-31 Ramon Ferrer-i-Cancho

The ability to produce and understand an unlimited number of different sentences is a hallmark of human language. Linguists have sought to define the essence of this generative capacity using formal grammars that describe the syntactic…

Computation and Language · Computer Science 2022-09-22 Carlos Gómez-Rodríguez , Morten H. Christiansen , Ramon Ferrer-i-Cancho

Null hypothesis significance testing remains popular despite decades of concern about misuse and misinterpretation. We believe that much of the problem is due to language: significance testing has little to do with other meanings of the…

Other Statistics · Statistics 2018-10-16 Jonathan Dushoff , Morgan P. Kain , Benjamin M. Bolker

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

Are pairs of words that tend to occur together also likely to stand in a linguistic dependency? This empirical question is motivated by a long history of literature in cognitive science, psycholinguistics, and NLP. In this work we…

Computation and Language · Computer Science 2022-05-02 Jacob Louis Hoover , Alessandro Sordoni , Wenyu Du , Timothy J. O'Donnell

The minimization of the length of syntactic dependencies is a well-established principle of word order and the basis of a mathematical theory of word order. Here we complete that theory from the perspective of information theory, adding a…

Computation and Language · Computer Science 2017-09-05 Ramon Ferrer-i-Cancho

Dependency distance minimization (DDm) is a well-established principle of word order. It has been predicted theoretically that DDm implies compression, namely the minimization of word lengths. This is a second order prediction because it…

Computation and Language · Computer Science 2023-10-16 Ramon Ferrer-i-Cancho , Carlos Gómez-Rodríguez

Here tree dependency structures are studied from three different perspectives: their degree variance (hubiness), the mean dependency length and the number of dependency crossings. Bounds that reveal pairwise dependencies among these three…

Computation and Language · Computer Science 2013-05-16 Ramon Ferrer-i-Cancho
‹ Prev 1 2 3 10 Next ›