Pregroup Grammar

Origin. Joachim Lambek (1999, 2008), a later reformulation of his 1958 syntactic calculus. Replaces the residuated (implicational) structure of the Lambek calculus with a pregroup: an ordered monoid with left and right adjoints. A non-commutative, order-based type logic for natural-language syntax.

Models. Grammatical categories as elements of a partially ordered monoid. Each word gets one or more types built from basic types and their left/right adjoints; a string is grammatical when the product of its types reduces (via contractions) to a designated sentence type. Word order is respected through non-commutativity, and the two adjoints encode "expects an argument to the left / right."

Formalism.

Pregroup: A partially ordered monoid (P, ·, 1, ≤) in which each a has a left adjoint aˡ and a right adjoint aʳ with: aˡ · a ≤ 1 ≤ a · aˡ and a · aʳ ≤ 1 ≤ aʳ · a. The contractions aˡa → 1 and aaʳ → 1 are the only reductions needed (expansions 1 → aaˡ etc. are not required for parsing).

Types: Basic types, e.g., n (noun/nominal), s (sentence), π (subject), o (object). Compound types are products of basic types and their iterated adjoints (…aˡˡ, aˡ, a, aʳ, aʳʳ…).

Reduction (parsing): Concatenate the word types; apply contractions xˡx → 1 and xxʳ → 1 (only adjacent, order-preserving). A sentence is well-formed if the whole product reduces to the sentence type s (≤ s).

Example: "John" : π ; "likes" : πʳ s oˡ ; "Mary" : o. π · (πʳ s oˡ) · o → (π πʳ) s (oˡ o) → 1·s·1 = s. Grammatical.

Relation to Lambek calculus: Pregroups are the "adjoint" (non-residuated) counterpart of the Lambek calculus; the two right/left divisions , / become adjoints ʳ, ˡ. Parsing is by cancellation rather than by hypothetical proof search.

Symbols.

Symbol	Unicode	Meaning
·	U+00B7	monoid product (concatenation)
≤	U+2264	partial order (derivability)
aˡ	—	left adjoint of a
aʳ	—	right adjoint of a
1	—	unit (empty type)
xˡx → 1	—	contraction (reduction step)

Metatheory. Reduction in a free pregroup is decidable and efficient: by Lambek's switching lemma only contractions are needed, so parsing is context-free-equivalent and polynomial. Pregroup grammars generate exactly the context-free languages (over the string yield), like the Lambek calculus. The compact, adjoint structure makes pregroups a compact closed category, which underlies their use in compositional distributional (categorical) semantics (DisCoCat), pairing syntax types with vector-space meanings.

Applies to. Computational syntax and parsing. Type-logical grammar (non-commutative substructural). Compositional distributional semantics (DisCoCat, tensor meanings). Cross-linguistic word-order modeling.

Limitations. Purely syntactic type calculus; needs an added semantic component for meaning. Non-associative or discontinuous phenomena strain the flat product structure (requiring extensions like the Lambek–Grishin or displacement calculus). Assigning types (the lexicon) is manual and can proliferate for words with many uses. Generative capacity is limited to context-free, so genuinely non-context-free constructions need enrichment.