Títol:
|
Anti dependency distance minimization in short sequences: A graph theoretic approach
|
Autor/a:
|
Ferrer Cancho, Ramon; Gómez Rodríguez, Carlos
|
Altres autors:
|
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 |
Abstract:
|
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 help of syntactic dependency treebanks where long sentences abound. However, it has been predicted theoretically that the principle is more likely to be beaten in short sequences by the principle of surprisal minimization (predictability maximization). Here we introduce a simple binomial test to verify such a hypothesis. In short sentences, we find anti-DDm for some languages from different families. Our analysis of the syntactic dependency structures suggests that anti-DDm is produced by star trees. |
Abstract:
|
Peer Reviewed |
Matèries:
|
-Àrees temàtiques de la UPC::Informàtica::Intel·ligència artificial::Llenguatge natural -Computational linguistics -Dependency syntax -Dependency distance minimization -Word order -Graph theory -Treebanks -Lingüística computacional |
Drets:
|
|
Tipus de document:
|
Article - Versió presentada Article |
Publicat per:
|
Informa UK (Taylor & Francis)
|
Compartir:
|
|