Symmetric Categorial Grammar
β Scribed by Michael Moortgat
- Publisher
- Springer Netherlands
- Year
- 2009
- Tongue
- English
- Weight
- 692 KB
- Volume
- 38
- Category
- Article
- ISSN
- 0022-3611
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
We present a new axiomatization of the non-associative Lambek calculus. We prove that it takes polynomial time to reduce any non-associative Lambek categorial grammar to an equivalent context-free grammar. Since it is possible to recognize a sentence generated by a context-free grammar in polynomial
Pentus (1992) proves the equivalence of LCG's and CFG's, and CFG's are equivalent to BCG's by the Gaifman theorem (Bar-Hillel et al., 1960). This paper provides a procedure to extend any LCG to an equivalent BCG by affixing new types to the lexicon; a procedure of that kind was proposed as early,