Loading...
Loading...

Go to the content (press return)

Anti dependency distance minimization in short sequences: A graph theoretic approach

Author
Ferrer-i-Cancho, R.; Gómez-Rodríguez, C.
Type of activity
Journal article
Journal
Journal of quantitative linguistics
Date of publication
2019-08-22
First page
1
Last page
23
DOI
10.1080/09296174.2019.1645547
Project funding
Management and Analysis of Complex DATA
Repository
http://hdl.handle.net/2117/168813 Open in new window
URL
https://www.tandfonline.com/doi/abs/10.1080/09296174.2019.1645547 Open in new window
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 i...
Citation
Ferrer-i-Cancho, R.; Gómez-Rodríguez, C. Anti dependency distance minimization in short sequences: A graph theoretic approach. "Journal of quantitative linguistics", 22 Agost 2019, p. 1-23.
Keywords
Dependency distance minimization, Dependency syntax, Graph theory, Treebanks, Word order
Group of research
LARCA - Laboratory of Relational Algorithmics, Complexity and Learnability

Participants