Mostra el registre d'ítem simple

dc.contributor.authorFerrer Cancho, Ramon
dc.contributor.otherUniversitat Politècnica de Catalunya. Departament de Ciències de la Computació
dc.date.accessioned2015-11-17T09:45:11Z
dc.date.available2017-01-03T01:30:20Z
dc.date.issued2016-01-01
dc.identifier.citationFerrer-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.isbn978-3-662-47238-5
dc.identifier.urihttp://hdl.handle.net/2117/79345
dc.description.abstractThe 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.extent32 p.
dc.language.isoeng
dc.publisherSpringer
dc.subjectÀrees temàtiques de la UPC::Informàtica::Intel·ligència artificial::Llenguatge natural
dc.subject.lcshComputational linguistics
dc.titleNon-crossing dependencies: Least effort, not grammar
dc.typePart of book or chapter of book
dc.subject.lemacLingüística computacional
dc.contributor.groupUniversitat Politècnica de Catalunya. LARCA - Laboratori d'Algorísmia Relacional, Complexitat i Aprenentatge
dc.identifier.doi10.1007/978-3-662-47238-5_10
dc.relation.publisherversionhttp://link.springer.com/chapter/10.1007%2F978-3-662-47238-5_10
dc.rights.accessOpen Access
local.identifier.drac17238333
dc.description.versionPostprint (author's final draft)
local.citation.authorFerrer-i-Cancho, R.
local.citation.publicationNameTowards a theoretical framework for analyzing complex linguistic networks
local.citation.startingPage203
local.citation.endingPage234


Fitxers d'aquest items

Thumbnail

Aquest ítem apareix a les col·leccions següents

Mostra el registre d'ítem simple