Encoding Phases using Commutativity and Non-commutativity in a Logical Framework - INRIA - Institut National de Recherche en Informatique et en Automatique Accéder directement au contenu
Communication Dans Un Congrès Année : 2011

Encoding Phases using Commutativity and Non-commutativity in a Logical Framework

Résumé

This article presents an extension of Minimalist Categorial Gram- mars (MCG) to encode Chomsky's phases. These grammars are based on Par- tially Commutative Logic (PCL) and encode properties of Minimalist Grammars (MG) of Stabler. The first implementation of MCG were using both non- commutative properties (to respect the linear word order in an utterance) and commutative ones (to model features of different constituents). Here, we pro- pose to adding Chomsky's phases with the non-commutative tensor product of the logic. Then we could give account of the PIC just by using logical prop- erties of the framework.
Fichier principal
Vignette du fichier
amblardlacl11.pdf (128.38 Ko) Télécharger le fichier
LACL11amblardslides.pdf (290.24 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)
Format : Autre

Dates et versions

hal-00601621 , version 1 (25-08-2011)

Identifiants

Citer

Maxime Amblard. Encoding Phases using Commutativity and Non-commutativity in a Logical Framework. 6th International Conference on Logical Aspect of Computational Linguistic - LACL 2011, Jun 2011, Montpellier, France. pp.1--16, ⟨10.1007/978-3-642-22221-4_1⟩. ⟨hal-00601621⟩
184 Consultations
234 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More