Encoding phases using commutativity and non-commutativity in a logical framework

N/ACitations
Citations of this article
2Readers
Mendeley users who have this article in their library.
Get full text

Abstract

This article presents an extension of Minimalist Categorial Grammars (MCG) to encode Chomsky's phases. These grammars are based on Partially Commutative Logic (PCL) and encode properties of Minimalist Grammars (MG) of Stabler [22]. 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 propose to augment Chomsky's phases with the non-commutative tensor product of the logic. Then we can give account of the PIC [7] just with logical properties of the framework instead of defining a specific rule. © 2011 Springer-Verlag Berlin Heidelberg.

Cite

CITATION STYLE

APA

Amblard, M. (2011). Encoding phases using commutativity and non-commutativity in a logical framework. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 6736 LNAI, pp. 1–16). https://doi.org/10.1007/978-3-642-22221-4_1

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free