Random crossings in dependency trees
Tipo de documentoArtículo
Fecha de publicación2017-03-01
Condiciones de accesoAcceso abierto
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 (the sentence length) and the second moment about zero of vertex degrees. The expected number of crossings is minimum for a star tree (crossings are impossible) and maximum for a linear tree (the number of crossings is of the order of the square of the sequence length).
CitaciónFerrer-i-Cancho, R. Random crossings in dependency trees. "Glottometrics", 1 Març 2017, vol. 37, p. 1-12.
Versión del editorhttp://www.ram-verlag.eu/wp-content/uploads/2017/04/g37zeit.pdf