Mostra el registre d'ítem simple
Kauffman's adjacent possible in word order evolution
dc.contributor.author | Ferrer Cancho, Ramon |
dc.contributor.other | Universitat Politècnica de Catalunya. Departament de Ciències de la Computació |
dc.date.accessioned | 2016-11-10T12:33:17Z |
dc.date.available | 2016-11-10T12:33:17Z |
dc.date.issued | 2016 |
dc.identifier.citation | Ferrer-i-Cancho, R. Kauffman's adjacent possible in word order evolution. A: International Conference on the Evolution of Language. "The Evolution of Language: Proceedings of the 11th International Conference (EVOLANG11)". New Orleans, Louisiana: 2016, p. 1-9. |
dc.identifier.isbn | 978-1-326-61450-8 |
dc.identifier.uri | http://hdl.handle.net/2117/96478 |
dc.description.abstract | Word order evolution has been hypothesized to be constrained by a word order permutation ring: transitions involving orders that are closer in the permutation ring are more likely. The hypothesis can be seen as a particular case of Kauffman's adjacent possible in word order evolution. Here we consider the problem of the association of the six possible orders of S, V and O to yield a couple of primary alternating orders as a window to word order evolution. We evaluate the suitability of various competing hypotheses to predict one member of the couple from the other with the help of information theoretic model selection. Our ensemble of models includes a six-way model that is based on the word order permutation ring (Kauffman's adjacent possible) and another model based on the dual two-way of standard typology, that reduces word order to basic orders preferences (e.g., a preference for SV over VS and another for SO over OS). Our analysis indicates that the permutation ring yields the best model when favoring parsimony strongly, providing support for Kauffman's general view and a six-way typology. |
dc.format.extent | 9 p. |
dc.language.iso | eng |
dc.rights | Attribution 4.0 International |
dc.rights.uri | http://creativecommons.org/licenses/by/4.0 international license |
dc.subject | Àrees temàtiques de la UPC::Informàtica::Intel·ligència artificial::Llenguatge natural |
dc.subject.lcsh | Computational linguistics |
dc.subject.other | Word order evolution |
dc.subject.other | Typology |
dc.subject.other | Kauffman's adjacent possible |
dc.title | Kauffman's adjacent possible in word order evolution |
dc.type | Conference report |
dc.subject.lemac | Lingüística computacional |
dc.contributor.group | Universitat Politècnica de Catalunya. LARCA - Laboratori d'Algorísmia Relacional, Complexitat i Aprenentatge |
dc.description.peerreviewed | Peer Reviewed |
dc.relation.publisherversion | http://evolang.org/neworleans/papers/83.html |
dc.rights.access | Open Access |
local.identifier.drac | 19192122 |
dc.description.version | Postprint (published version) |
local.citation.author | Ferrer-i-Cancho, R. |
local.citation.contributor | International Conference on the Evolution of Language |
local.citation.pubplace | New Orleans, Louisiana |
local.citation.publicationName | The Evolution of Language: Proceedings of the 11th International Conference (EVOLANG11) |
local.citation.startingPage | 1 |
local.citation.endingPage | 9 |