As our first step, we show how this syntactic analysis formalism works by presenting an introduction to pregroup algebras.
r The binary operation • is an associative, non-commutative monoid multiplication with the type − • − : P × P → P, such that if a, b ∈ P then a • b ∈ P. P is closed under this operation.