M. Daniel and . Albro, An earley-style recognition algorithm for mcfgs, 2000.

M. Amblard, Représentations sémantiques pour les grammaires minimalistes, 2003.

M. Amblard, Counting dependencies and Minimalist Grammars, 2005.
URL : https://hal.archives-ouvertes.fr/hal-01079268

P. Boullier, Proposal for a Natural Langage Procesing Syntactic Backbone, 1998.

P. Boullier, Chinese numbers, MIX, scrambling, and range concatenation grammars, Proceedings of the ninth conference on European chapter of the Association for Computational Linguistics -, pp.53-60, 1999.
DOI : 10.3115/977035.977044
URL : https://hal.archives-ouvertes.fr/inria-00073064

J. Cocke and J. T. Schwartz, Programming languages and their compilers: preliminary notes, 1970.

]. J. Ear70 and . Earley, An efficient context-free parsing algorithm, Communications of the Association for Computing Machinery, 1970.

[. Guillaumin, Conversions between Mildly Context Sensitive Grammars, 2004.

H. Harkema, Parsing Minimalist Languages, 2001.

H. Harkema, A Characterization of Minimalistic Languages, LACL 2001, 2001.

K. Aravind, L. Joshi, M. Levy, and . Takahashi, Tree Adjunct Grammars, Journal of Computer and System Sciences, 1975.

K. Aravind and . Joshi, Mildly Context-Sensitive Grammars

K. Aravind and . Joshi, Tree Adjoining Grammars: How much context sensitivity is required to provide a reasonable structural description. Natural Language Parsing, pp.206-250, 1985.

K. Aravind, Y. Joshi, and . Schabes, Tree-adjoining grammars, Handbook of formal languages, pp.69-123, 1997.

[. Kallmeyer, A descriptive characterization of multicomponent tree adjoining grammars, TALN 2005, 2005.

]. T. Kas65 and . Kasami, An efficient recognition and syntax-analysis algorithm for context-free languages, 1965.

H. Kolb and J. Michaelis, An operational and denotational approach to non-context-freeness, Theoretical Computer Science, vol.293, issue.2, pp.261-289, 2003.
DOI : 10.1016/S0304-3975(01)00348-6

E. Keenan and E. Stabler, There is more than one language, Langues et Grammaire-I, 1994.

P. Ljunglöf, A Polynomial Time Extension of Parallel Multiple Context-Free Grammar, LACL 2005, 2005.
DOI : 10.1007/11422532_12

J. Michaelis, Derivational Minimalism Is Mildly Context???Sensitive, LACL '98: Selected papers from the Third International Conference, on Logical Aspects of Computational Linguistics, pp.179-198, 2001.
DOI : 10.1007/3-540-45738-0_11

J. Michaelis, Observations on Strict Derivational Minimalism, Proceedings of the joint meeting of the 6th Conference on Formal Grammar and the 7th Conference on Mathematics of Language (FGMOL '01), 2001.
DOI : 10.1016/S1571-0661(05)82583-6

J. Michaelis, On Formal Properties of Minimalist Grammars, 2001.

J. Michaelis, Transforming Linear Context-Free Rewriting Systems into Minimalist Grammars, LACL '01: Proceedings of the 4th International Conference on Logical Aspects of Computational Linguistics, pp.228-244, 2001.
DOI : 10.1007/3-540-48199-0_14

J. Michaelis, Implications of a revised perspective on minimalist grammars, 2002.

J. Michaelis and G. Kobele, Two Type 0-Variants of Minimalist Grammars, The 10th conference on Formal Grammar and The 9th Meeting on Mathematics of Language, 2005.

[. Morawietz, Two-Step Approaches to Natural Language Formalisms. Studies in Generative Grammar, 2003.

W. Schuler, D. Chiang, and M. Dras, Multi-component TAG and notions of formal power, Proceedings of the 38th Annual Meeting on Association for Computational Linguistics , ACL '00, pp.448-455, 2000.
DOI : 10.3115/1075218.1075275

P. Edward, T. C. Stabler, G. M. Collier, Y. Kobele, Y. Lee et al., The learning and emergence of mildly context sensitive languages, European Conference of Artificial Life. ECAL, 2003.

M. Stuart and . Shieber, Evidence againts the context-freeness of natural language, Linguistics and Philosophy 8, pp.333-343, 1985.

H. Seki, T. Matsumura, M. Fujii, and T. Kasami, On multiple context-free grammars, Theoretical Computer Science, vol.88, issue.2, pp.191-229, 1991.
DOI : 10.1016/0304-3975(91)90374-B

P. Edward and . Stabler, Acquiring languages with movement, 1997.

P. Edward and . Stabler, Derivational minimalism, Lecture Notes in Computer Science, vol.1328, p.68, 1997.

P. Edward and . Stabler, Minimalist grammars and recognition, 2000.

P. Edward and . Stabler, Recognizing head movement, LACL '01: Proceedings of the 4th International Conference on Logical Aspects of Computational Linguistics, pp.245-260, 2001.

P. Edward and . Stabler, Languages universals: a computational perspective, LSA 2005, 2005.

[. Vannoord, Reversibility in Natural Language Processing [vV96] N. van Vugt. Generalized Context-Free Grammars, 1993.

J. David and . Weir, Characterizing mildly context-sensitive grammar formalisms, 1988.

I. Unité-de-recherche, . Lorraine, . Loria, and . Technopôle-de-nancy, Brabois -Campus scientifique 615, rue du Jardin Botanique -BP 101 -54602 Villers-lès-Nancy Cedex (France) Unité de recherche INRIA Rennes : IRISA, Campus universitaire de Beaulieu -35042 Rennes Cedex (France) Unité de recherche INRIA Rhône-Alpes : 655, avenue de l'Europe -38334 Montbonnot Saint-Ismier (France) Unité de recherche INRIA Rocquencourt, Domaine de Voluceau -Rocquencourt -BP 105 -78153 Le Chesnay Cedex (France) Unité de recherche INRIA Sophia Antipolis : 2004, route des Lucioles -BP 93 -06902 Sophia Antipolis Cedex

I. De-voluceau-rocquencourt, BP 105 -78153 Le Chesnay Cedex (France) http://www.inria.fr ISSN, pp.249-6399