Listar Lingua e Sociedade da Información (Language in the Information Society) (LYS) por autor "Ferrer-i-Cancho, Ramon"

Mostrando ítems 1-5 de 5

    • Cognitive Constraints Built into Formal Grammars: Implications for Language Evolution 

      Gómez-Rodríguez, Carlos; Christiansen, Morten H.; Ferrer-i-Cancho, Ramon (Ravignani, A., Barbieri, C., Martins, M., Flaherty, M., Jadoul, Y., Lattenkamp, E., Little, H., Mudd, K., Verhoef, T., 2020-04-17)
      [Abstract] We study the validity of the cognitive independence assumption using an ensemble of artificial syntactic structures from various classes of dependency grammars. Our findings show that memory limitations have ...

    • Liberating language research from dogmas of the 20th century 

      Ferrer-i-Cancho, Ramon; Gómez-Rodríguez, Carlos (2016)
      [Abstract] A commentary on the article “Large -scale evidence of dependency length minimization in 37 languages” by Futrell, Mahowald & Gibson (PNAS 2015 112 (33) 10336-10341).

    • Memory limitations are hidden in grammar 

      Gómez-Rodríguez, Carlos; Christiansen, Morten H.; Ferrer-i-Cancho, Ramon (RAM-Verlag, 2022)
      [Abstract] The ability to produce and understand an unlimited number of different sentences is a hallmark of human language. Linguists have sought to define the essence of this generative capacity using formal grammars ...

    • Optimality of syntactic dependency distances 

      Ferrer-i-Cancho, Ramon; Gómez-Rodríguez, Carlos; Esteban, Juan Luis; Alemany-Puig, Lluís (American Physical Society, 2022-01)
      [Abstract]: It is often stated that human languages, as other biological systems, are shaped by cost-cutting pressures but, to what extent? Attempts to quantify the degree of optimality of languages by means of an optimality ...

    • The scaling of the minimum sum of edge lengths in uniformly random trees 

      Esteban, Juan Luis; Ferrer-i-Cancho, Ramon; Gómez-Rodríguez, Carlos (2016-06)
      [Abstract] The minimum linear arrangement problem on a network consists of finding the minimum sum of edge lengths that can be achieved when the vertices are arranged linearly. Although there are algorithms to solve this ...