Exploració per tema "Categorial grammar"
Ara es mostren els items 1-10 de 10
-
A count invariant for Lambek calculus with additives and bracket modalities
(Springer-Verlag Berlin Heidelberg, 2013)
Text en actes de congrés
Accés restringit per política de l'editorialThe count invariance of van Benthem (1991) is that for a sequent to be a theorem of the Lambek calculus, for each atom, the number of positive occurrences equals the number of negative occurrences. (The same is true ... -
A polynomial-time algorithm for the Lambek calculus with brackets of bounded order
(Dagstuhl Publishing, 2017)
Text en actes de congrés
Accés obertLambek calculus is a logical foundation of categorial grammar, a linguistic paradigm of grammar as logic and parsing as deduction. Pentus (2010) gave a polynomial-time algorithm for determining provability of bounded depth ... -
Computational coverage of type logical grammar: The Montague test
(2016)
Text en actes de congrés
Accés obertIt is nearly half a century since Montague made his contributions to the field of logical semantics. In this time, computational linguistics has taken an almost entirely statistical turn and mainstream linguistics has ... -
Count-invariance including exponentials
(Association for Computational Linguistics, 2017)
Comunicació de congrés
Accés restringit per política de l'editorialWe define infinitary count-invariance for categorial logic, extending countinvariance for multiplicatives (van Benthem, 1991) and additives and bracket modalities (Valentín et al., 2013) to include exponentials. This ... -
Discontinuity and pied-piping in categorial grammar
(1993-06)
Report de recerca
Accés obertDiscontinuity refers to the phenomena in many natural language constructions whereby signs differ markedly in their prosodic and semantic forms. As such it presents interesting demands on monostratal computational formalisms ... -
Un Motor de generació categorial
(1998-10)
Report de recerca
Accés obertMerenciano and Morrill (1997), -
Parsing logical grammar: CatLog3
(Stockholm University, 2017)
Text en actes de congrés
Accés obertCatLog3 is a Prolog parser/theorem-prover for (type) logical (categorial) grammar. In such logical grammar, grammar is reduced to logic: a string of words is grammatical if and only if an associated logical statement is a ... -
Parsing/theorem-proving for logical grammar CatLog3
(Springer, 2019-06)
Article
Accés obertCatLog3 is a 7000 line Prolog parser/theorem-prover for logical categorial grammar. In such logical categorial grammar syntax is universal and grammar is reduced to logic: an expression is grammatical if and only if an ... -
Spurious ambiguity and focalization
(2018-06)
Article
Accés obertSpurious ambiguity is the phenomenon whereby distinct derivations in grammar may assign the same structural reading, resulting in redundancy in the parse search space and inefficiency in parsing. Understanding the problem ... -
Structural ambiguity in Montague Grammar and categorial grammar
(2015-01)
Article
Accés restringit per política de l'editorialWe give a type logical categorial grammar for the syntax and semantics of Montague's seminal fragment, which includes ambiguities of quantification and intensionality and their interactions, and we present the analyses ...