• Jens Michaelis. Transforming Linear Context-Free Rewriting Systems into Minimalist Grammars. Paper presented at the conference Logical Aspects of Computational Linguistics (LACL `01), Le Croisic, June 27-29, 2001. Revised version appeared in P. de Groote, G. Morrill & C. Retoré (eds.), Logical Aspects of Computational Linguistics, LNCS/LNAI Vol. 2099, pp. 228-244, Springer, Berlin, Heidelberg, 2001.

Abstract

The type of a minimalist grammar (MG) as introduced by Stabler (1997, 1998) provides an attempt of a rigorous algebraic formalization of the new perspectives adopted within the linguistic framework of transformational grammar due to the change from GB-theory to minimalism. Michaelis (1998) has shown that MGs constitute a subclass of mildly context-sensitive grammars in the sense that for each MG there is a weakly equivalent linear context-free rewriting system (LCFRS). However, it has been left open in Michaelis 1998, whether the respective classes of string languages derivable by MGs and LCFRSs coincide. This paper completes the picture by showing that MGs in the sense of Stabler 1997 and LCFRSs in fact determine the same class of derivable string languages.

previous page personal homepage