English
Related papers

Related papers: Random crossings in dependency trees

200 papers

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

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

In spatial networks vertices are arranged in some space and edges may cross. When arranging vertices in a 1-dimensional lattice edges may cross when drawn above the vertex sequence as it happens in linguistic and biological networks. Here…

Discrete Mathematics · Computer Science 2020-02-24 Lluís Alemany-Puig , Ramon Ferrer-i-Cancho

The syntactic structure of a sentence is often represented using syntactic dependency trees. The sum of the distances between syntactically related words has been in the limelight for the past decades. Research on dependency distances led…

Computation and Language · Computer Science 2023-10-16 Lluís Alemany-Puig , Ramon Ferrer-i-Cancho

The use of null hypotheses (in a statistical sense) is common in hard sciences but not in theoretical linguistics. Here the null hypothesis that the low frequency of syntactic dependency crossings is expected by an arbitrary ordering of…

Computation and Language · Computer Science 2020-09-24 Ramon Ferrer-i-Cancho

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

Dependency trees have proven to be a very successful model to represent the syntactic structure of sentences of human languages. In these structures, vertices are words and edges connect syntactically-dependent words. The tendency of these…

Computation and Language · Computer Science 2024-03-05 Lluís Alemany-Puig , 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

We study the scaling limit of random forest with prescribed degree sequence in the regime that the largest tree consists of all but a vanishing fraction of nodes. We give a description of the limit of the forest consisting of the small…

Probability · Mathematics 2023-06-22 Tao Lei

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

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

Minimal spanning trees on infinite vertex sets are investigated. A criterion for minimality of a spanning tree having a finite length is obtained, which generalizes the corresponding classical result for finite sets. It is given an analytic…

Metric Geometry · Mathematics 2014-03-18 A. O. Ivanov , A. A. Tuzhilin

Spanning trees are an important quantity characterizing the reliability of a network, however, explicitly determining the number of spanning trees in networks is a theoretical challenge. In this paper, we study the number of spanning trees…

Statistical Mechanics · Physics 2010-08-03 Zhongzhi Zhang , Hongxiao Liu , Bin Wu , Shuigeng Zhou

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

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

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

We consider the number of crossings in a random labelled tree with vertices in convex position. We give a new proof of the fact that this quantity is asymptotically Gaussian with mean $n^2/6$ and variance $n^3/45$. Furthermore, we give an…

Probability · Mathematics 2022-09-21 Santiago Arenas-Velilla , Octavio Arizmendi

We prove that the number of crossings in a random labelled tree with vertices in convex position is asymptotically Gaussian with mean $ n^2/6$ and variance $ n^3/45$. A similar result is proved for points in general position under mild…

Probability · Mathematics 2019-02-15 Octavio Arizmendi , Pilar Cano , Clemens Huemer
‹ Prev 1 2 3 10 Next ›