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

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

2011-08-25

arxiv.org/abs/1108.5027v1

Computer Science

Computation and Language

Logical Aspect of Computational Linguistic, Montpellier : France (2011)

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

Encoding Phases using Commutativity and Non-commutativity in a Logical Framework does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Encoding Phases using Commutativity and Non-commutativity in a Logical Framework, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Encoding Phases using Commutativity and Non-commutativity in a Logical Framework will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-318762