Articles de revista
http://hdl.handle.net/2117/3487
Tue, 13 Oct 2015 21:52:43 GMT2015-10-13T21:52:43ZDisplacement logic for anaphora
http://hdl.handle.net/2117/28349
Displacement logic for anaphora
Morrill, Glyn; Valentín Fernández Gallart, José Oriol
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 while remaining free of structural rules and enjoying Cut-elimination and its good corollaries. Jäger (2005) [11] proposes a type logical treatment of anaphora with syntactic duplication using limited contraction. Morrill and Valentín (2010) [24] apply (modal) displacement calculus to anaphora with lexical duplication and propose extension with a negation as failure in conjunction with additives to capture binding conditions. In this paper we present an account of anaphora developing characteristics and employing machinery from both of these proposals.
Sat, 01 Mar 2014 00:00:00 GMThttp://hdl.handle.net/2117/283492014-03-01T00:00:00ZThe placement of the head that minimizes online memory: a complex systems approach
http://hdl.handle.net/2117/28306
The placement of the head that minimizes online memory: a complex systems approach
Ferrer Cancho, Ramon
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 equivalent to the problem of the minimum linear arrangement of a star tree. However, how that length is translated into cognitive cost is not known. This study shows that the online memory cost is minimized when the head is placed at the center, regardless of the function that transforms length into cost, provided only that this function is strictly monotonically increasing. Online memory defines a quasi-convex adaptive landscape with a single central minimum if the number of elements is odd and two central minima if that number is even. We discuss various aspects of the dynamics of word order of subject (S), verb (V) and object (O) from a complex systems perspective and suggest that word orders tend to evolve by swapping adjacent constituents from an initial or early SOV configuration that is attracted towards a central word order by online memory minimization. We also suggest that the stability of SVO is due to at least two factors, the quasi-convex shape of the adaptive landscape in the online memory dimension and online memory adaptations that avoid regression to SOV. Although OVS is also optimal for placing the verb at the center, its low frequency is explained by its long distance to the seminal SOV in the permutation space.
Mon, 02 Mar 2015 00:00:00 GMThttp://hdl.handle.net/2117/283062015-03-02T00:00:00ZReply to the commentary "Be careful when assuming the obvious", by P. Alday
http://hdl.handle.net/2117/28305
Reply to the commentary "Be careful when assuming the obvious", by P. Alday
Ferrer Cancho, Ramon
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 measurement of dependency length and the monotonicity of the cost of a dependency as a function of its length. We also revise the implicit psychological bias in Alday’s comments. Notwithstanding, Alday is indicating the path for linguistic research with his unusual concerns about parsimony from multiple dimensions.
Mon, 02 Mar 2015 00:00:00 GMThttp://hdl.handle.net/2117/283052015-03-02T00:00:00ZThe risks of mixing dependency lengths from sequences of different length
http://hdl.handle.net/2117/28279
The risks of mixing dependency lengths from sequences of different length
Ferrer Cancho, Ramon; Liu, Haitao
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 of varying length. The distribution of dependency lengths depends on sentence length for real sentences and also under the null hypothesis that dependencies connect vertices located in random positions of the sequence. This suggests that certain results, such as the distribution of syntactic dependency lengths mixing dependencies from sentences of varying length, could be a mere consequence of that mixing. Furthermore, differences in the global averages of dependency length (mixing lengths from sentences of varying length) for two different languages do not simply imply a priori that one language optimizes dependency lengths better than the other because those differences could be due to differences in the distribution of sentence lengths and other factors.
Fri, 07 Nov 2014 00:00:00 GMThttp://hdl.handle.net/2117/282792014-11-07T00:00:00ZBeyond description: Comment on “Approaching human language with complex networks” by Cong and Liu
http://hdl.handle.net/2117/28273
Beyond description: Comment on “Approaching human language with complex networks” by Cong and Liu
Ferrer Cancho, Ramon
Mon, 01 Dec 2014 00:00:00 GMThttp://hdl.handle.net/2117/282732014-12-01T00:00:00ZA categorial type logic
http://hdl.handle.net/2117/28269
A categorial type logic
Morrill, Glyn
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 semantic proofs. Thereby, logical categorial grammar embodies in a pure logical form the principles of compositionality, lex-icalism, and parsing as deduction. Interest has focused on multimodal versions but the advent of the (dis)placement calculus of Morrill, Valentín and Fadda [21] suggests that the role of structural rules can be reduced, and this facilitates computational implementation. In this paper we specify a comprehensive formalism of (dis) placement logic for the parser/theorem prover CatLog integrating categorial logic connectives proposed to date and illustrate with a cover grammar of the Montague fragment.
Wed, 01 Jan 2014 00:00:00 GMThttp://hdl.handle.net/2117/282692014-01-01T00:00:00ZAdaptively learning probabilistic deterministic automata from data streams
http://hdl.handle.net/2117/28256
Adaptively learning probabilistic deterministic automata from data streams
Balle Pigem, Borja de; Castro Rabal, Jorge; Gavaldà Mestre, Ricard
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 guarantees exist for specific classes of models such as Probabilistic Deterministic Finite Automata (PDFA). Here we focus on PDFA and give an algorithm for inferring models in this class in the restrictive data stream scenario: Unlike existing methods, our algorithm works incrementally and in one pass, uses memory sublinear in the stream length, and processes input items in amortized constant time. We also present extensions of the algorithm that (1) reduce to a minimum the need for guessing parameters of the target distribution and (2) are able to adapt to changes in the input distribution, relearning new models when needed. We provide rigorous PAC-like bounds for all of the above. Our algorithm makes a key usage of stream sketching techniques for reducing memory and processing time, and is modular in that it can use different tests for state equivalence and for change detection in the stream.
Tue, 01 Jul 2014 00:00:00 GMThttp://hdl.handle.net/2117/282562014-07-01T00:00:00ZLearning read-constant polynomials of constant degree modulo composites
http://hdl.handle.net/2117/28159
Learning read-constant polynomials of constant degree modulo composites
Chattopadhyay, Arkadev; Gavaldà Mestre, Ricard; Arnsfelt Hansen, Kristoffer; Thérien, Denis
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 by programs over fixed and finite nilpotent groups. This class is not known to be learnable in any reasonable learning model. In this paper, we provide a deterministic polynomial time algorithm for learning Boolean functions represented by polynomials of constant degree over arbitrary finite rings from membership queries, with the additional constraint that each variable in the target polynomial appears in a constant number of monomials. Our algorithm extends to superconstant but low degree polynomials and still runs in quasipolynomial time.
Fri, 01 Aug 2014 00:00:00 GMThttp://hdl.handle.net/2117/281592014-08-01T00:00:00ZSemantically inactive multiplicatives and words as types
http://hdl.handle.net/2117/28038
Semantically inactive multiplicatives and words as types
Morrill, Glyn; Valentín Fernández Gallart, José Oriol
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 proposal for semantically inactive multiplicatives. In this paper we formulate such a proposal (thus filling a gap in the typology of categorial connectives) in the context of the displacement calculus Morrill et al. (2011[16]), and we give a formulation of words as types whereby for every expression w there is a corresponding type W(w). We show how this machinary can treat the syntax and semantics of collocations involving apparently contentless words such as expletives, particle verbs, and (discontinuous) idioms. In addition, we give an account in these terms of the only known examples treated by Hybrid Type Logical Grammar (HTLG henceforth; Kubota and Levine 2012[4]) beyond the scope of unaugmented displacement calculus: gapping of particle verbs and discontinuous idioms.
Wed, 01 Jan 2014 00:00:00 GMThttp://hdl.handle.net/2117/280382014-01-01T00:00:00ZIsometries on L-2(X) and monotone functions
http://hdl.handle.net/2117/27512
Isometries on L-2(X) and monotone functions
Boza Rocho, Santiago; Soria, Javier
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 (e.g., if X = R+, to the cone of positive and decreasing functions). We also consider the problem of characterizing the sets Y subset of X for which the orthogonal projection of the operator T on L-2(Y) is also an isometry. Finally, we illustrate our results with several examples involving classical operators on different settings. (C) 2013 WILEY-VCH Verlag GmbH & Co. KGaA, Weinheim
Sat, 01 Feb 2014 00:00:00 GMThttp://hdl.handle.net/2117/275122014-02-01T00:00:00Z