Extending Lambek Grammars: a Logical Account of Minimalist Grammars

We provide a logical definition of Minimalist grammars, that are Stabler's formalization of Chomsky's minimalist program. Our logical definition leads to a neat relation to categorial grammar, (yielding a treatment of Montague semantics), a parsing-asdeduction in a resource sensitive logic, and a learning algorithm from structured data (based on a typing-algorithm and type-unification). Here we emphasize the connection to Montague semantics which can be viewed as a formal computation of the logical form. 1 Presentation The connection between categorial grammars (especially in their logical setting) and minimalist grammars, which has already been observed and discussed (Retor

• Type: Conference
• Year: 2001
• Where: ACL
• Authors: Alain Lecomte, Christian Retoré
• Keywords: ACL 2001, ACL 2007, Categorial Grammar, Logical Definition, Minimalist Grammar