Recent Submissions

  • Displacement logic for anaphora 

    Morrill, Glyn; Valentín Fernández Gallart, José Oriol (2014-03)
    Article
    Restricted access - publisher's policy
    The displacement calculus of Morrill, Valentín and Fadda (2011) [25] aspires to replace the calculus of Lambek (1958) [13] as the foundation of categorial grammar by accommodating intercalation as well as concatenation ...
  • The placement of the head that minimizes online memory: a complex systems approach 

    Ferrer Cancho, Ramon (2015-03-02)
    Article
    Restricted access - publisher's policy
    It is well known that the length of a syntactic dependency determines its online memory cost. Thus, the problem of the placement of a head and its dependents (complements or modifiers) that minimizes online memory is ...
  • Reply to the commentary "Be careful when assuming the obvious", by P. Alday 

    Ferrer Cancho, Ramon (2015-03-02)
    Article
    Restricted access - publisher's policy
    Here we respond to some comments by Alday concerning headedness in linguistic theory and the validity of the assumptions of a mathematical model for word order. For brevity, we focus only on two assumptions: the unit of ...
  • The risks of mixing dependency lengths from sequences of different length 

    Ferrer Cancho, Ramon; Liu, Haitao (2014-11-07)
    Article
    Restricted access - publisher's policy
    Mixing dependency lengths from sequences of different length is a common practice in language research. However, the empirical distribution of dependency lengths of sentences of the same length differs from that of sentences ...
  • Beyond description: Comment on “Approaching human language with complex networks” by Cong and Liu 

    Ferrer Cancho, Ramon (2014-12-01)
    Article
    Restricted access - publisher's policy
  • A categorial type logic 

    Morrill, Glyn (2014)
    Article
    Restricted access - publisher's policy
    In logical categorial grammar [23,11] syntactic structures are categorial proofs and semantic structures are intuitionistic proofs, and the syntax-semantics interface comprises a homomorphism from syntactic proofs to ...
  • Adaptively learning probabilistic deterministic automata from data streams 

    Balle Pigem, Borja de; Castro Rabal, Jorge; Gavaldà Mestre, Ricard (2014-07)
    Article
    Restricted access - publisher's policy
    Markovian models with hidden state are widely-used formalisms for modeling sequential phenomena. Learnability of these models has been well studied when the sample is given in batch mode, and algorithms with PAC-like ...
  • Learning read-constant polynomials of constant degree modulo composites 

    Chattopadhyay, Arkadev; Gavaldà Mestre, Ricard; Arnsfelt Hansen, Kristoffer; Thérien, Denis (2014-08)
    Article
    Restricted access - publisher's policy
    Boolean functions that have constant degree polynomial representation over a fixed finite ring form a natural and strict subclass of the complexity class ACC0. They are also precisely the functions computable efficiently ...
  • Semantically inactive multiplicatives and words as types 

    Morrill, Glyn; Valentín Fernández Gallart, José Oriol (2014)
    Article
    Restricted access - publisher's policy
    The literature on categorial type logic includes proposals for semantically inactive additives, quantifiers, and modalities (Morrill 1994[17]; Hepple 1990[2]; Moortgat 1997[9]), but to our knowledge there has been no ...
  • Isometries on L-2(X) and monotone functions 

    Boza Rocho, Santiago; Soria, Javier (2014-02-01)
    Article
    Restricted access - publisher's policy
    We study necessary and sufficient conditions on a bounded operator T defined on the Hilbert space L-2(X) to be an isometry and show that, under suitable hypotheses, it suffices to restrict T to a smaller class of functions ...

View more