Para acceder a los documentos con el texto completo, por favor, siga el siguiente enlace: http://hdl.handle.net/2117/112359
Título: | Are crossing dependencies really scarce? |
---|---|
Autor/a: | Ferrer Cancho, Ramon; Gómez Rodríguez, Carlos; Esteban Ángeles, Juan Luis |
Otros autores: | Universitat Politècnica de Catalunya. Departament de Ciències de la Computació; Universitat Politècnica de Catalunya. LARCA - Laboratori d'Algorísmia Relacional, Complexitat i Aprenentatge; Universitat Politècnica de Catalunya. LOGPROG - Lògica i Programació |
Abstract: | 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. However, a baseline or null hypothesis has been lacking. Here we quantify the amount of crossings of real sentences and compare it to the predictions of a series of baselines. We conclude that crossings are really scarce in real sentences. Their scarcity is unexpected by the hubiness of the trees. Indeed, real sentences are close to linear trees, where the potential number of crossings is maximized. |
Abstract: | Peer Reviewed |
Materia(s): | -Àrees temàtiques de la UPC::Informàtica::Intel·ligència artificial::Llenguatge natural -Computational linguistics -Baselines -Crossings -Spatial networks -Syntactic dependency trees -Lingüística computacional |
Derechos: | Attribution-NonCommercial-NoDerivs 3.0 Spain
http://creativecommons.org/licenses/by-nc-nd/3.0/es/ |
Tipo de documento: | Artículo - Versión presentada Artículo |
Compartir: |