• Summary
• Related Documents
  • Active Bibliography
  • Co-citation
• Version History

Abstract:

without proceedings We provide a logical definition of Minimalist grammars, that are Stabler's formalization of Chomsky's minimalist program. Our logical definition, even simpler than the original one, leads to:- a neat relation to categorial grammar, yielding a treatment of Montague semantics.- a parsing-as-deduction in some resource sensitive logic- a learning algorithm from structured data based on a typing-algorithm and type-unification. Our view of minimalist grammars also is an extension of Lambek grammars: we keep their radical lexicalism and logical view. The generative capacity is increased by using a mixed commutative / non commutative logic due to de Groote, and this logic is not used as in Lambek grammars:- product is essential, since it encodes movement- up to now hypothetical reasonning is not needed, i.e. we only have elimination rules as in classical (AB) categorial grammars or combinatory categorial grammars- the proof determines the consumption of the valencies- but word order is computed from the proof by a simple device (the relation between word-order and valency-consumption is more flexible than in Lambek grammars). This allows for a proper account of sophisticated syntactic contructions (expletives, long-distance dependencies,...) and to compute Montague-like semantics from syntactic analyses. Extending Lambek grammars: a logical account of minimalist grammars

Citations