scientific article; zbMATH DE number 1341534
From MaRDI portal
Publication:4263075
zbMath0934.03043MaRDI QIDQ4263075
No author found.
Publication date: 25 April 2000
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
ordered monoidposet modelEnglishfree pregroupsnon-commutative linear logicWh-questionsfree protogrouppassiveswell-formed sentences
Logic of natural languages (03B65) Semigroups in automata theory, linguistics, etc. (20M35) Substructural logics (including relevance, entailment, linear logic, Lambek calculus, BCK and BCI logics) (03B47)
Related Items (47)
Natural language semantics in biproduct dagger categories ⋮ Generalized relations in linguistics \& cognition ⋮ Displacement logic for anaphora ⋮ Lambek vs. Lambek: functorial vector space semantics and string diagrams for Lambek calculus ⋮ Ambiguity and Incomplete Information in Categorical Models of Language ⋮ Uniqueness of Composition in Quantum Theory and Linguistics ⋮ DisCoPy: Monoidal Categories in Python ⋮ Relation algebras as expanded FL-algebras ⋮ A type-driven vector semantics for ellipsis with anaphora using Lambek calculus with limited contraction ⋮ Pre-rigid monoidal categories ⋮ Compositional Event Semantics in Pregroup Grammars ⋮ A computational algebraic analysis of Hindi syntax ⋮ Complemented MacNeille completions and algebras of fractions ⋮ Categorial Grammars and Their Logics ⋮ A generalised quantifier theory of natural language in categorical compositional distributional semantics with bialgebras ⋮ Type logics and pregroups ⋮ Applying pregroups to Italian statements and questions ⋮ Linear processing with pregroups ⋮ Commutation-augmented pregroup grammars and mildly context-sensitive languages ⋮ On the logic of \(\beta\)-pregroups ⋮ Should pregroup grammars be adorned with additional operations? ⋮ Commutation-augmented pregroup grammars and push-down automata with cancellation ⋮ Lattice-ordered pregroups are semi-distributive ⋮ NP-Completeness of Grammars Based Upon Products of Free Pregroups ⋮ Distributional Semantics: A Montagovian View ⋮ Italian Clitic Patterns in Pregroup Grammar: State of the Art ⋮ On Associative Lambek Calculus Extended with Basic Proper Axioms ⋮ Pregroup grammars with letter promotions: complexity and context-freeness ⋮ Logic and grammar ⋮ Semantic vector models and functional models for pregroup grammars ⋮ Word Order Alternation in Sanskrit via Precyclicity in Pregroup Grammars ⋮ Periodic lattice-ordered pregroups are distributive ⋮ Galois Connections in Categorial Type Logic ⋮ Mildly Context-Sensitive Languages via Buffer Augmented Pregroup Grammars ⋮ Exploring feature agreement in French with parallel pregroup computations ⋮ Efficiency of pregroups and the French noun phrase ⋮ Extending free pregroups with lower bounds ⋮ Generalized Categorial Dependency Grammars ⋮ Pregroups and natural language processing ⋮ Toward discourse representation via pregroup grammars ⋮ From word to sentence: a pregroup analysis of the object pronoun \textit{who(m)} ⋮ Pregroup grammars and Chomsky's earliest examples ⋮ Kindergarden quantum mechanics graduates \textit{...or how I learned to stop gluing LEGO together and love the ZX-calculus} ⋮ On the complexity of nonassociative Lambek calculus with unit ⋮ Extensions of Lambek Calculi ⋮ Quantum computations for disambiguation and question answering ⋮ The Pentus theorem for Lambek calculus with simple nonlogical axioms
This page was built for publication:
