Enviaments recents

  • Learning definite Horn formulas from closure queries 

    Arias Vicente, Marta; Balcázar Navarro, José Luis; Tîrnauca, Cristina (2017-01-07)
    Article
    Accés obert
    A definite Horn theory is a set of n-dimensional Boolean vectors whose characteristic function is expressible as a definite Horn formula, that is, as conjunction of definite Horn clauses. The class of definite Horn theories ...
  • Compression and the origins of Zipf's law for word frequencies 

    Ferrer Cancho, Ramon (2016-11-01)
    Article
    Accés obert
    Here we sketch a new derivation of Zipf's law for word frequencies based on optimal coding. The structure of the derivation is reminiscent of Mandelbrot's random typing model but it has multiple advantages over random ...
  • Crossings as a side effect of dependency lengths 

    Ferrer Cancho, Ramon; Gómez Rodríguez, Carlos (2016-11-01)
    Article
    Accés obert
    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 ...
  • The infochemical core 

    Hernández Fernández, Antonio; Ferrer Cancho, Ramon (2016-06-07)
    Article
    Accés restringit per política de l'editorial
    Vocalizations, and less often gestures, have been the object of linguistic research for decades. However, the development of a general theory of communication with human language as a particular case requires a clear ...
  • A reply to Kubota and Levine on gapping 

    Valentín Fernández Gallart, José Oriol; Morrill, Glyn (2017-02)
    Article
    Accés restringit per política de l'editorial
    In a series of papers Kubota and Levine give an account of gapping and determiner gapping in terms of hybrid type logical grammar, including anomalous scopal interactions with auxiliaries and negative quantifiers. We make ...
  • Rehabilitation profiles of older adult stroke survivors admitted to intermediate care units: A multi-centre study 

    Pérez, Laura M.; Inzitari, Marco; Quinn, Terence J.; Montaner, Joan; Gavaldà Mestre, Ricard; Duarte, Esther; Coll Planas, Laura; Cerdá, Mercé; Santaeugenia, Sebastia; Closa, Conxita; Gallofre, Miquel (2016-11-09)
    Article
    Accés obert
    Background: Stroke is a major cause of disability in older adults, but the evidence around post-acute treatment is limited and heterogeneous. We aimed to identify profiles of older adult stroke survivors admitted to ...
  • The meaning-frequency law in Zipfian optimization models of communication 

    Ferrer Cancho, Ramon (2016-10-10)
    Article
    Accés obert
    According to Zipf’s meaning-frequency law, words that are more frequent tend to have more meanings. Here it is shown that a linear dependency between the frequency of a form and its number of meanings is found in a family ...
  • On graph combinatorics to improve eigenvector-based measures of centrality in directed networks 

    Arratia Quesada, Argimiro Alejandro; Marijuan López, Carlos (Elsevier, 2016-09-01)
    Article
    Accés restringit per política de l'editorial
    We present a combinatorial study on the rearrangement of links in the structure of directed networks for the purpose of improving the valuation of a vertex or group of vertices as established by an eigenvector-based ...
  • Gelada vocal sequences follow Menzerath's linguistic law 

    Gustison, Morgan; Semple, Stuart; Ferrer Cancho, Ramon; Bergman, Thore (2016-03-04)
    Article
    Accés obert
    Identifying universal principles underpinning diverse natural systems is a key goal of the life sciences. A powerful approach in addressing this goal has been to test whether patterns consistent with linguistic laws are ...
  • 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
    Accés restringit per política de l'editorial
    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 ...

Mostra'n més