Corpus ID: 15036127

Pregroup Grammars and Context-free Grammars

  title={Pregroup Grammars and Context-free Grammars},
  author={W. Buszkowski and K. Moroz},
Pregroup grammars were introduced by Lambek [20] as a new formalism of type-logical grammars. They are weakly equivalent to context-free grammars [8]. The proof in one direction uses the fact that context-free languages are closed under homomorphism and inverse homomorphism. Here we present a direct construction of a context-free grammar and a push-down automaton, equivalent to a given pregroup grammar. The size of the resulting contextfree grammar (push-down automaton) is polynomial in the… Expand
Mildly Context-Sensitive Languages via Buffer Augmented Pregroup Grammars
A strict hierarchy is established within the family of mildly context-sensitive languages defined by buffer augmented pregroup grammars, where the hierarchy level of the family language depends on the allowed number of occurrences of the variable in lexical category assignments. Expand
Cyclic pregroups and natural language: a computational algebraic analysis
This paper proposes an extension of the calculus of pregroups by introducing appropriate cyclic rules that will allow the grammar to formally analyze and compute word order and movement phenomena in different languages such as Persian, French, Italian, Dutch and Hungarian. Expand
Pregroup grammars with letter promotions: Complexity and context-freeness
It is proved that pregroup grammars with letter promotions are equivalent to context-free Grammars, and the problem is reduced to a graph-theoretic problem, which is subsequently reduced to the emptiness problem for context- free languages. Expand
Lambeck calculus and substructural logics
It is shown how certain proof-theoretic tools are used to establish basic properties of Lambek systems and grammars (decidability, generative capacity, complexity) and some results on Lambek Systems and Grammars help to solve problems in substructural logics. Expand
Pregroups and pregroup grammars were introduced by Lambek in 1999 [14] as an algebraic tool for the syntactic analysis of natural languages. The main focus in that paper was on certain extendedExpand
Pregroup Grammars with Letter Promotions
The Letter Promotion Problem for pregroups is solvable in polynomial time, if the size of p(n) is counted as |n|+1, and the problem is reduced to a graph-theoretic problem, which is subsequently reduced to the emptiness problem for context-free languages. Expand
Commutation-augmented pregroup grammars and push-down automata with cancellation
The paper proves a pumping lemma for a certain subclass of mildly context-sensitive languages, the one defined by commutation-augmented pregroup grammars; in addition, an automaton equivalent to suchExpand
Incremental Monoidal Grammars
This work defines formal grammars in terms of free monoidal categories, along with a functor from the category of formal Grammar to the categories of automata, to link the categorical viewpoint on natural language to the standard machine learning notion of probabilistic language model. Expand
Complexity of Grammar Induction for Quantum Types
It is shown that for a variety of type systems, including pivotal and compact closed categories, the grammar induction problem is NP-complete, and could be extended to linguistic type systems such as autonomous or bi-closed categories. Expand
Parsing pregroup grammars in polynomial time
  • K. Moroz
  • Computer Science
  • 2009 International Multiconference on Computer Science and Information Technology
  • 2009
A cubic parsing algorithm for ambiguous pregroup grammars and a Java application that uses the algorithm for parsing natural language sentences and applies metarules to keep the lexicon reasonably small are presented. Expand


Fully Lexicalized Pregroup Grammars
This work shows here how to transform, using a morphism on types, a particular pre group grammar into another pregroup grammar that uses the equality as the order on primitive types. Expand
Lambek grammars are context free
  • M. Pentus
  • Mathematics, Computer Science
  • [1993] Proceedings Eighth Annual IEEE Symposium on Logic in Computer Science
  • 1993
The Chomsky conjecture, that all languages recognized by the Lambek calculus are context-free, is proved and thus every basic categorial grammar is equivalent to a Lambek grammar. Expand
The Pentus Theorem for Lambek Calculus with Simple Nonlogical Axioms
The weak equivalence of the Context-Free Grammars and grammars based on L(Γ) is obtained, and the interpolation lemma and binary reduction lemma are proved. Expand
Lambek Grammars Based on Pregroups
This paper proves some new theorems on pre-groups and study grammars based on the calculus of free pregroups that are equivalent to context-free Grammars and discusses the relation of pregroups to the Lambek calculus. Expand
Categorial Grammars and Natural Language Structures
Categorial Grammars as Theories of Language.- The Lambek Calculus.- Generative Power of Categorial Grammars.- Semantic Categories and the Development of Categorial Grammars.- Aspects of a CategorialExpand
Type Logics and Pregroups
The cut-elimination theorem and a normalization theorem for an extended system of this logic, its P-TIME decidability, its interpretation in L1, and a general construction of (preordered) bilinear algebras and pregroups whose universe is an arbitrary monoid are discussed. Expand
Parsing Pregroup Grammars and Lambek Calculus Using Partial Composition
The paper presents a way to transform pregroup grammars into contextfree grammars using functional composition. The same technique can also be used for the proof-nets of multiplicative cyclic linearExpand
Free compact 2-categories
  • A. Preller, J. Lambek
  • Computer Science, Mathematics
  • Mathematical Structures in Computer Science
  • 2007
This work investigates the free compact 2- category generated by a given category, and describes its 2-cells as labelled transition systems, and obtains a decision procedure for the equality of 2- cells in the free Compact 2-category. Expand
Residuated lattices: An algebraic glimpse at sub-structural logics
This book considers both the algebraic and logical perspective within a common framework, and shows how proof theoretical methods like cut elimination are preferable for small logics/theories, but semantic tools like Rabin's theorem work better for big ones. Expand
Type Grammars as Pregroups
This article presents an algebraic model of grammar in the form of a pregroup, which competes with an earlier model which was once proposed by me and is now being developed further by a small but dedicated group of researchers, and took the shape of a residuated monoid. Expand