In: How much context-sensitivity is necessary for characterizing structural descriptions ? Tree Adjoining Grammars, 1985. ,
Characterizing Mildly Context-Sensitive Grammar Formalisms, 1988. ,
An Introduction to Tree Adjoining Grammar, Mathematics of Language, pp.87-114, 1987. ,
DOI : 10.1075/z.35.07jos
Characterizing structural descriptions produced by various grammatical formalisms, Proceedings of the 25th annual meeting on Association for Computational Linguistics -, pp.104-111, 1987. ,
DOI : 10.3115/981175.981190
On TAG parsing, Traitement Automatique des Langues (T.A.L.), vol.41, issue.3, pp.759-793, 2000. ,
URL : https://hal.archives-ouvertes.fr/inria-00073004
On Multicomponent TAG parsing In: 6 me confrence annuelle sur le Traitement Automatique des Langues Naturelles (TALN'99), 1999. ,
Guided parsing of range concatenation languages, Proceedings of the 39th Annual Meeting on Association for Computational Linguistics , ACL '01, pp.42-49, 2001. ,
DOI : 10.3115/1073012.1073019
Tree insertion grammar: A cubic-time, parsable formalism that lexicalizes context-free grammar without changing the trees produced, Computational Linguistics, vol.21, 1994. ,
Tree adjunct grammars, Journal of Computer and System Sciences, vol.10, issue.1, pp.136-163, 1975. ,
DOI : 10.1016/S0022-0000(75)80019-5
A generalization of mildly context-sensitive formalisms, Proceedings of TAG+4, pp.17-20, 1998. ,
Range Concatenation Grammars, pp.269-289, 2004. ,
DOI : 10.1007/1-4020-2295-6_13
URL : https://hal.archives-ouvertes.fr/inria-00073064
On multiple context-free grammars, Theoretical Computer Science, vol.88, issue.2, pp.191-229, 1991. ,
DOI : 10.1016/0304-3975(91)90374-B
A cubic time extension of context-free grammars, Grammars, vol.3, issue.2/3, pp.111-131, 2000. ,
DOI : 10.1023/A:1009907814595
URL : https://hal.archives-ouvertes.fr/inria-00073067