Paper: Parsing With Polymorphism

ACL ID E93-1016
Title Parsing With Polymorphism
Venue Annual Meeting of The European Chapter of The Association of Computational Linguistics
Session Main Conference
Year 1993

Certain phenomena resist coverage within the Lambek Calculus, such as scope- ambiguity and non-peripheral extraction. I have argued in previous work that an ex- tension called Polymorphic Lambek Calcu- lus (PLC), which adds variables and their universal quantification, covers these phe- nomena. However, a major problem is the absence of a known decision procedure for PLC grammars. This paper proposes a de- cision procedure which covers a subset of all the possible PLC grammars, a subset which, however, includes the PLC gram- mars with wide coverage. The decision pro- cedure is shown to be terminating, and cor- rect, and a Prolog implementation of it is described. 1 The Lambek Calculus To begin, I give a brief description of Lambek cate- gorial grammar [Lambek, 1958]. The categories are bui...