Now showing items 1-6 of 6

  • A dependency look at the reality of constituency 

    Chen, Xinying; Gómez Rodríguez, Carlos; Ferrer Cancho, Ramon (RAM-Verlag, 2018)
    Article
    Open Access
    A comment on “Neurophysiological dynamics of phrase-structure building during sentence processing” by Nelson et al (2017), Proceedings of the National Academy of Sciences USA 114(18), E3669-E3678.
  • Are crossing dependencies really scarce? 

    Ferrer Cancho, Ramon; Gómez Rodríguez, Carlos; Esteban Ángeles, Juan Luis (2018-03-01)
    Article
    Restricted access - publisher's policy
    The syntactic structure of a sentence can be modelled as a tree, where vertices correspond to words and edges indicate syntactic dependencies. It has been claimed recurrently that the number of edge crossings in real ...
  • Crossings as a side effect of dependency lengths 

    Ferrer Cancho, Ramon; Gómez Rodríguez, Carlos (2016-11-01)
    Article
    Open Access
    The syntactic structure of sentences exhibits a striking regularity: dependencies tend to not cross when drawn above the sentence. We investigate two competing explanations. The traditional hypothesis is that this trend ...
  • Liberating language research from dogmas of the 20th century 

    Ferrer Cancho, Ramon; Gómez Rodríguez, Carlos (2016-02-25)
    Article
    Open Access
    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).
  • Scarcity of crossing dependencies: A direct outcome of a specific constraint? 

    Gómez Rodríguez, Carlos; Ferrer Cancho, Ramon (American Chemical Society (ACS), 2017-12-04)
    Article
    Open Access
    The structure of a sentence can be represented as a network where vertices are words and edges indicate syntactic dependencies. Interestingly, crossing syntactic dependencies have been observed to be infrequent in human ...
  • The scaling of the minimum sum of edge lengths in uniformly random trees 

    Esteban Ángeles, Juan Luis; Ferrer Cancho, Ramon; Gómez Rodríguez, Carlos (Institute of Physics (IOP), 2016-06-21)
    Article
    Open Access
    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 problem on ...