Une grammaire ??lectronique du fran??ais, Computational Linguistics, vol.29, issue.3, 2002. ,
DOI : 10.1162/coli.2003.29.3.510
Variants of mixed parsing of TAG and TIG, pp.4441-65, 2003. ,
Organisation modulaire et paramétrable de grammaires électroniques lexicalisées, 1999. ,
Grammar compaction and computation sharing in automata-based parsing, Proceedings of Tabulation in Parsing and Deduction (TAPD'98), pp.16-25, 1998. ,
Représentation informatique de grammaires d'arbres fortement lexicalisées : le cas de la grammaire d'arbres adjoints, 2005. ,
XTAG system ? a wide coverage grammar for English, Proc. of the 15th International Conference on Computational Linguistics (COLING'94), pp.922-928, 1994. ,
The Metagrammar Compiler: An NLP Application with a Multi-paradigm Architecture, 2nd International Mozart/Oz Conference, 2004. ,
DOI : 10.1007/978-3-540-31845-3_15
URL : https://hal.archives-ouvertes.fr/inria-00100264
Integrated natural language generation with schema-tree adjoining grammars, Language Production, 2004. ,
An Introduction to Tree Adjoining Grammar, Mathematics of Language, pp.87-115, 1987. ,
DOI : 10.1075/z.35.07jos
TuLiPA, Proceedings of the Workshop on Grammar Engineering Across Frameworks, GEAF '08, 2008. ,
DOI : 10.3115/1611546.1611547
URL : https://hal.archives-ouvertes.fr/hal-00460709
Hypertags, Proceedings of the 18th conference on Computational linguistics -, pp.446-452, 2000. ,
DOI : 10.3115/990820.990885
Partially ordered multiset context-free grammars and freeword-order parsing, 8th International Workshop on Parsing Technologies (IWPT'03), pp.171-182, 2003. ,
DOI : 10.3115/1073083.1073104
URL : http://acl.ldc.upenn.edu/P/P02/P02-1015.pdf
Easy, evaluation of parsers of french: what are the results?, Proceedings of the 6 th International Conference on Language Resources and Evaluation (LREC), 2008. ,
Generating the XTAG english grammar using metarules, Proceedings of the 19th international conference on Computational linguistics -, pp.1-7, 2002. ,
DOI : 10.3115/1072228.1072381
Tree insertion grammar: a cubic-time, parsable formalism that lexicalizes context-free grammar without changing the trees produced, Fuzzy Sets Syst, vol.76, issue.3, pp.309-317, 1995. ,