Parsing with Structure-preserving Categorial Grammars

a a\b ABarley ABCYK agenda Ajdukiewicz-Bar-Hillel Algorithm 7.2 application associative Lambek calculus axioms AXº bridge formula Buszkowski categorial grammars CF grammars Chapter chart Chomsky normal form clitic combinatory categorial grammar completeness computational construction context-free grammars CYK algorithm deductive system define Definition 5.9 Earley Earley algorithm Earley parser equivalent Example exhaust-agenda function grammar G grammars with product Groote Hence implementation inference rules input sequent input string John whistles Kandulski lambda terms Lambek grammars lexical lexicon logic method modal frame Moortgat multi-modal NL grammar non-associative Lambek calculus normal derivations notation NP VP objects of type parsing system polarized formula polynomial postulates prediction premises procedure product-free proof proof nets Proposition prove recognition red-black trees respecting the subformula result semantic set of sequents slash spurious ambiguity structural rules subformula property syntactic categories type-logical grammar unary operators variant w₁ Wi+1 ΓΔ