no code implementations • 14 Jun 2022 • Lluís Alemany-Puig, Juan Luis Esteban, Ramon Ferrer-i-Cancho
In the projective variant for rooted trees, arrangements have to be planar and the root of the tree cannot be covered by any edge.
1 code implementation • 5 Dec 2021 • Lluís Alemany-Puig, Juan Luis Esteban, Ramon Ferrer-i-Cancho
One of the main concerns in this field is the statistical patterns of syntactic dependency structures.
no code implementations • 5 Feb 2021 • Lluís Alemany-Puig, Juan Luis Esteban, Ramon Ferrer-i-Cancho
Gildea and Temperley (GT) sketched an algorithm for projective arrangements which they claimed runs in $O(n)$ but did not provide any justification of its cost.
2 code implementations • 30 Jul 2020 • Ramon Ferrer-i-Cancho, Carlos Gómez-Rodríguez, Juan Luis Esteban, Lluís Alemany-Puig
Here we recast the problem of the optimality of the word order of a sentence as an optimization problem on a spatial network where the vertices are words, arcs indicate syntactic dependencies and the space is defined by the linear order of the words in the sentence.
no code implementations • 24 Jun 2020 • Ramon Ferrer-i-Cancho, Carlos Gómez-Rodríguez, Juan Luis Esteban
A fundamental problem in network science is the normalization of the topological or physical distance between vertices, that requires understanding the range of variation of the unnormalized distances.