Loading...
Loading...

Go to the content (press return)

Random crossings in dependency trees

Author
Ferrer-i-Cancho, R.
Type of activity
Journal article
Journal
Glottometrics
Date of publication
2017-03-01
Volume
37
First page
1
Last page
12
Repository
http://hdl.handle.net/2117/106079 Open in new window
https://arxiv.org/abs/1305.4561 Open in new window
URL
http://www.ram-verlag.eu/wp-content/uploads/2017/04/g37zeit.pdf Open in new window
Abstract
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 expected number of crossings if the natural order of a sentence was lost and replaced by a random ordering? We show that this number depends only on the number of vertices of the dependency tree (...
Citation
Ferrer-i-Cancho, R. Random crossings in dependency trees. "Glottometrics", 1 Març 2017, vol. 37, p. 1-12.
Keywords
Crossings, Distance, Planarity, Syntactic dependency trees, Syntax
Group of research
LARCA - Laboratory of Relational Algorithmics, Complexity and Learnability

Participants

Attachments