Linear Grammars with Labels

Alain Lecomte (1) , Houda Anoun (2)

1 SFL - Structures Formelles du Langage
2 LaBRI - Laboratoire Bordelais de Recherche en Informatique

The purpose of the paper is to show that we can work in the spirit of Minimalist Grammars by means of an unirected deductive system called LGE, enhanced with constraints on the use of assumptions. Lexical entries can be linked to sequences of controlled hypotheses which represent intermediary sites. The assumptions must be introduced in the derivation and then discharged in tandem by their proper entry which will therefore manage to find its final position: this allows to logically simulate move operation. Relevance of this formalism is stressed by showing its ability to give a compositional semantics in the line of R. Montague.

Cet article montre qu'on peut simuler le minimalisme à l'intérieur d'un cadre de grammaire de types logiques. Ceci a pour effet intéressant de pouvoir réaliser l'objectif d'une grammaire compositionnelle à la Montague dans le cadre chomskyen.

Mots clés: Type Logical Grammars; Minimalist Grammars; Compositional Semantics; Move; ellipsis

Mots clés: Grammaires de Types Logiques; Grammaires Minimalistes; Déplacements; ellipses

Domaines: Linguistique

Alain Lecomte, Houda Anoun. Linear Grammars with Labels. Aug 2006, pp.15-29. ⟨halshs-00122665⟩