Mostra el registre d'ítem simple
Non-crossing dependencies: Least effort, not grammar
dc.contributor.author | Ferrer Cancho, Ramon |
dc.contributor.other | Universitat Politècnica de Catalunya. Departament de Ciències de la Computació |
dc.date.accessioned | 2015-11-17T09:45:11Z |
dc.date.available | 2017-01-03T01:30:20Z |
dc.date.issued | 2016-01-01 |
dc.identifier.citation | Ferrer-i-Cancho, R. Non-crossing dependencies: Least effort, not grammar. A: "Towards a theoretical framework for analyzing complex linguistic networks". Springer, 2016, p. 203-234. |
dc.identifier.isbn | 978-3-662-47238-5 |
dc.identifier.uri | http://hdl.handle.net/2117/79345 |
dc.description.abstract | The use of null hypotheses (in a statistical sense) is common in hard sciences but not in theoretical linguistics. Here the null hypothesis that the low frequency of syntactic dependency crossings is expected by an arbitrary ordering of words is rejected. It is shown that this would require star dependency structures, which are both unrealistic and too restrictive. The hypothesis of the limited resources of the human brain is revisited. Stronger null hypotheses taking into account actual dependency lengths for the likelihood of crossings are presented. Those hypotheses suggests that crossings are likely to reduce when dependencies are shortened. A hypothesis based on pressure to reduce dependency lengths is more parsimonious than a principle of minimization of crossings or a grammatical ban that is totally dissociated from the general and non-linguistic principle of economy. |
dc.format.extent | 32 p. |
dc.language.iso | eng |
dc.publisher | Springer |
dc.subject | Àrees temàtiques de la UPC::Informàtica::Intel·ligència artificial::Llenguatge natural |
dc.subject.lcsh | Computational linguistics |
dc.title | Non-crossing dependencies: Least effort, not grammar |
dc.type | Part of book or chapter of book |
dc.subject.lemac | Lingüística computacional |
dc.contributor.group | Universitat Politècnica de Catalunya. LARCA - Laboratori d'Algorísmia Relacional, Complexitat i Aprenentatge |
dc.identifier.doi | 10.1007/978-3-662-47238-5_10 |
dc.relation.publisherversion | http://link.springer.com/chapter/10.1007%2F978-3-662-47238-5_10 |
dc.rights.access | Open Access |
local.identifier.drac | 17238333 |
dc.description.version | Postprint (author's final draft) |
local.citation.author | Ferrer-i-Cancho, R. |
local.citation.publicationName | Towards a theoretical framework for analyzing complex linguistic networks |
local.citation.startingPage | 203 |
local.citation.endingPage | 234 |
Fitxers d'aquest items
Aquest ítem apareix a les col·leccions següents
-
Capítols de llibre [14]
-
Capítols de llibre [86]