. Activeverbform, CanonicalNominalObject] l3:marie(m)[ProperName]

J. and M. Marie-est-aimé-de-jean-b, l1:le(c)[Det] l1:chien(c)[Noun] l2:dormir(e1,c)[RelativeSubject] l3:ronfle(e2,c)

. Le-chien-qui-dort-ronfle-le-chien-qui-ronfle-dort-c, jean(j)[ProperName] l2:promettre(e1,j,m,e2)[CanonicalNominalSubject, ActiveVerbForm, CompletiveObject] l3:marie(m)[ProperName] l4:partir(e2,j)[InfinitivalVerb] Jean prometàprometà Marie de partir Jean prometàprometà Marie qu'il partira Jean doit partir/*C'est Jean il faut que qui part " Sometimes overgeneration will only occur with some of a family's trees, this case the third line of the sr-item indicates which are those trees and their distinguishing properties (i.e. the properties that always result in overgeneration)

]. A. Abeillé, Lexical and syntactic rules in a Tree Adjoining Grammar, Proceedings of the 28th annual meeting on Association for Computational Linguistics -, pp.292-298, 1990.
DOI : 10.3115/981823.981860

]. A. Abeillé, Une grammaire ??lectronique du fran??ais, Computational Linguistics, vol.29, issue.3, 2002.
DOI : 10.1162/coli.2003.29.3.510

]. D. Appelt, Bidirectional grammars and the design of natural language generation systems, Proceedings of the 1987 workshop on Theoretical issues in natural language processing -, pp.185-191, 1987.
DOI : 10.3115/980304.980352

. Balkan, Tsnlp ? test suites for natural language processing, Proceedings of Language Engineering Convention, pp.17-22, 1994.
DOI : 10.1108/eb051385

URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=

J. Bangalore, A. K. Bangalore, and . Joshi, Supertagging: an approach to almost parsing, Computational Linguistics, vol.25, issue.2, pp.237-265, 1999.
DOI : 10.1007/978-94-015-9470-7_11

. Bangalore, . S. Rambow, O. Bangalore, and . Rambow, Corpus-based lexical choice in natural language generation, Proceedings of the 38th Annual Meeting on Association for Computational Linguistics , ACL '00, pp.464-471, 2000.
DOI : 10.3115/1075218.1075277

. Bangalore, . S. Rambow, O. Bangalore, and . Rambow, Using TAGs, a tree model and a language model for generation, Proceedings of TAG+5, 2000.

. Bateman, The nondirectional representation of Systemic Functional Grammars and semantics as typed feature structures, Proceedings of the 14th conference on Computational linguistics -, pp.916-920, 1992.
DOI : 10.3115/992383.992401

. Belz, ]. A. Reiter, E. Belz, and . Reiter, Comparing automatic and human evaluation of NLG systems, Proceedings of EACL, pp.313-320, 2006.

. Boguraev, Software support for practical grammar development, Proceedings of the 12th conference on Computational linguistics -, pp.54-58, 1988.
DOI : 10.3115/991635.991647

. Bibliography and . Bonfante, Analyse syntaxiqué electrostatique. ´ Evolutions en analyse syntaxique, Revue TAL, issue.3, p.44, 2003.

. Bonfante, Polarization and abstraction of grammatical formalisms as methods for lexical disambiguation, Proceedings of the 20th international conference on Computational Linguistics , COLING '04, pp.303-309, 2004.
DOI : 10.3115/1220355.1220399

URL : https://hal.archives-ouvertes.fr/inria-00099886

]. J. Bos, Predicate logic unplugged, Proceedings of the 10th Amsterdam Colloquium, pp.133-143, 1995.

]. C. Brew, Letting the cat out of the bag, Proceedings of the 14th conference on Computational linguistics -, 1992.
DOI : 10.3115/992133.992165

. Briscoe, A formalism and environment for the development of a large grammar of English, Proceedings of the 10th International Joint Conference on Artificial Intelligence, pp.703-708, 1987.

. Calder, An algorithm for generation in Unification Categorial Grammar, Proceedings of the fourth conference on European chapter of the Association for Computational Linguistics -, pp.233-240, 1989.
DOI : 10.3115/976815.976847

]. C. Callaway, Evaluating Coverage for Large Symbolic NLG Grammars, Proceedings of the Eighteenth International Joint Conference on Artificial Intelligence, pp.811-817, 2003.

C. , O. Carroll, and S. Oepen, High efficiency realization for a wide-coverage unification grammar, Proceedings of the 2nd International Joint Conference on Natural Language Processing, 2005.

. Copestake, Minimal Recursion Semantics: An Introduction, Research on Language and Computation, vol.19, issue.1, pp.281-332, 2005.
DOI : 10.1007/s11168-006-6327-9

D. Crabbé, Crabbé and D. Duchier. Metagrammar redux, International Workshop on Constraint Solving and Language Processing -CSLP 2004, 2004.

]. L. Danlos, Conceptual and linguistic decisions in generation, Proceedings of the 10th international conference on Computational linguistics, pp.501-504, 1984.

D. Duchier, R. Duchier, and . Debusmann, Topological dependency trees, Proceedings of the 39th Annual Meeting on Association for Computational Linguistics , ACL '01, pp.180-187, 2001.
DOI : 10.3115/1073012.1073036

I. Dymetman, P. Dymetman, and . Isabelle, Reversible Logic Grammars for Machine Translation. Canadian Workplace Automation Research Centre, 1988.

]. M. Elhadad and J. Robin, SURGE: a comprehensive plug-in syntactic realization component for text generation, Computational Linguistics, 1999.

]. M. Elhadad, FUF: The universal unifier user manual version 5.0. Columbia University, 1991.

]. D. Gabbay, Labelled Deductive Systems, 1996.
DOI : 10.1016/S1874-5075(03)80014-1

]. C. Gardent and L. Kallmeyer, Semantic construction in FTAG, Proceedings of the 10th EACL, 2003.

K. Gardent, E. Gardent, and . Kow, Generating and selecting grammatical paraphrases, Proceedings of the ENLG, 2005.

K. Gardent, E. Gardent, and . Kow, A symbolic approach to near-deterministic surface realisation using Tree Adjoining Grammar, Proceedings of the 45th Annual Meeting of the Association of Computational Linguistics, pp.328-335, 2007.
URL : https://hal.archives-ouvertes.fr/inria-00149366

]. C. Gardent, Integration d'une dimension semantique dans les grammaires d'arbres adjoints, 2006.

. Gerdemann, ]. D. Hinrichs, E. Gerdemann, and . Hinrichs, Some open problems in head-driven-generation, Linguistics & Computation, S, pp.165-197, 1995.

]. Gerdemann, Parsing and Generation of Unification Grammars, 1991.

]. M. Halliday, Language as Social Semiotic: The Social Interpretation of Language and Meaning, 1978.

. Mak-halliday, An Introduction to Functional Linguistics, 1985.

U. Hopcroft, J. D. Hopcroft, and . Ullman, Introduction to Automata Theory, Languages and Computation, 1979.
DOI : 10.1145/568438.568455

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

S. K. Joshi, B. Joshi, and . Srinivas, Disambiguation of super parts of speech (or supertags), Proceedings of the 15th conference on Computational linguistics -, pp.154-160, 1994.
DOI : 10.3115/991886.991912

. Joshi, 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

URL : http://doi.org/10.1016/s0022-0000(75)80019-5

]. A. Joshi, The Relevance of Tree Adjoining Grammar to Generation, 1987.
DOI : 10.1007/978-94-009-3645-4_16

]. T. Kasami, An efficient recognition and syntax algorithm for context-free languages. Air Force Cambridge Research Laboratory report AF- CRL-65-758, 1965.

]. M. Kay, Chart generation, Proceedings of the 34th annual meeting on Association for Computational Linguistics -, pp.200-204, 1996.
DOI : 10.3115/981863.981890

. Knight, ]. K. Hatzivassiloglou, V. Knight, and . Hatzivassiloglou, Twolevel , many-paths generation, Proc. ACL, p.95, 1995.
DOI : 10.3115/981658.981692

URL : http://arxiv.org/abs/cmp-lg/9506010

. Koller, ]. A. Striegnitz, K. Koller, and . Striegnitz, Generation as dependency parsing, Proceedings of the 40th Annual Meeting on Association for Computational Linguistics , ACL '02, 2002.
DOI : 10.3115/1073083.1073088

URL : http://acl.ldc.upenn.edu/P/P02/P02-1003.pdf

]. E. Kow, Adapting polarised disambiguation to surface realisation, 17th European Summer School in Logic, Language and Information -ESSLLI'05, 2005.
URL : https://hal.archives-ouvertes.fr/inria-00000344

J. S. Kroch, A. K. Kroch, and . Joshi, The Linguistic Relevance of Tree Adjoining Grammar, 1985.

]. I. Langkilde-geary and . Langkilde-geary, An empirical verification of coverage and correctness for a general-purpose sentence generator, Proceedings of the 12th International Natural Language Generation Workshop, pp.17-24, 2002.

]. I. Langkilde, Forest-based statistical sentence generation, Proceedings of the first conference on North American chapter of the Association for Computational Linguistics, pp.170-177, 2000.

R. Lavoie, O. Lavoie, and . Rambow, RealPro?a fast, portable sentence realizer, p.97, 1997.

. J. Le-roux and . Roux, Intersection optimisation is NP-complete, 2007.

]. J. Le-roux and . Roux, La coordination dans les grammaires d'interaction, 2007.
URL : https://hal.archives-ouvertes.fr/inria-00185237

]. J. Levine, PRAGMA?a flexible bidirectional dialogue system, AAAI-90 [8], pp.964-969, 1990.

P. Mcdonald, D. David, J. D. Mcdonald, and . Pustejovsky, TAGs as a grammatical formalism for generation, Proceedings of the 23rd annual meeting on Association for Computational Linguistics -, pp.94-103, 1985.
DOI : 10.3115/981210.981222

]. G. Neumann, A Uniform Computational Model for Natural Language Parsing and Generation, 1994.

]. G. Perrier, Les grammaires d'interaction, 2003. HabilitationàHabilitation`Habilitationà diriger les recherches en informatique, 2003.

D. Reiter, Reiter and Dale. Building Natural Language Generation Systems, 2000.

]. D. Revuz, Minimisation of acyclic deterministic automata in linear time, Theoretical Computer Science, vol.92, issue.1, pp.181-189, 1992.
DOI : 10.1016/0304-3975(92)90142-3

URL : https://hal.archives-ouvertes.fr/hal-00619678

S. S. Schabes and . Shieber, An alternative conception of tree-adjoining derivation, Proceedings of the 30th annual meeting on Association for Computational Linguistics -, pp.91-124, 1994.
DOI : 10.3115/981967.981989

. Schabes, Parsing strategies with'lexicalized'grammars: application to tree adjoining grammars, Proceedings of the 12th conference on Computational linguistics, pp.578-583, 1988.

]. H. Shemtov, Generation of paraphrases from ambiguous logical forms, Proceedings of the 16th conference on Computational linguistics -, pp.919-924, 1996.
DOI : 10.3115/993268.993327

. Shieber, Semantic-head-driven generation, Computational Linguistics, vol.16, issue.1, pp.30-41, 1990.

. Shieber, Principles and implementation of deductive parsing, 23rd Annual Meeting of the Association for Computational Linguistics, pp.3-36, 1985.
DOI : 10.1016/0743-1066(95)00035-I

M. Stuart and . Shieber, A uniform architecture for parsing and generation, Proceedings of the 12th conference on Computational linguistics, pp.614-619, 1988.

M. Stuart and . Shieber, The problem of logical-form equivalence, Comput. Linguist, vol.19, issue.1, pp.179-190, 1993.

. Stent, Evaluating Evaluation Methods for Generation in the Presence of Variation, Proceedings of CICLING, pp.341-351, 2005.
DOI : 10.1007/978-3-540-30586-6_38

. Stone, ]. M. Doran, C. Stone, and . Doran, Sentence planning as description using tree adjoining grammar, Proceedings of the 35th conference on Association for Computational Linguistics, pp.198-205, 1997.
DOI : 10.3115/976909.979643

URL : http://acl.ldc.upenn.edu/P/P97/P97-1026.pdf

. Stone, Microplanning with Communicative Intentions: The SPUD System, Computational Intelligence, vol.9, issue.2, pp.311-381, 2003.
DOI : 10.1016/S0004-3702(98)00083-6

]. K. Striegnitz, Interleaving Sentence Planning With Contextual Reasoning: a system description, 2000.

K. Striegnitz, A Chart-based Generation Algorithm for LTAG with Pragmatic Constraints, 2001.

K. Striegnitz, Generating Anaphoric Expressions ? Contextual Inference in Sentence Planning, 2004.

]. P. Tapanainen, Applying a finite-state intersection grammar . Finite-State Language Processing, p.311327, 1997.

]. M. Tomita, An efficient augmented-context-free parsing algorithm, Computational Linguistics, vol.13, issue.12, pp.31-46, 1987.

. Van-noord-]-gertjan and . Van-noord, BUG: A directed bottom up generator for unification based formalisms, 1989.

]. G. Van-noord and . Van-noord, Error mining for wide-coverage grammar engineering, Proceedings of the 42nd Annual Meeting on Association for Computational Linguistics , ACL '04, 2004.
DOI : 10.3115/1218955.1219012

J. Vijay-shanker, A. Vijay-shanker, and . Joshi, Feature structures based Tree Adjoining Grammars, Proceedings of the 12th conference on Computational linguistics -, p.2, 1988.
DOI : 10.3115/991719.991783

]. J. Wedekind, Generation as structure driven derivation, Proceedings of the 12th conference on Computational linguistics -, pp.732-737, 1988.
DOI : 10.3115/991719.991786

URL : http://acl.ldc.upenn.edu/C/C88/C88-2150.pdf

]. P. Whitelock, Shake-and-bake translation, Proceedings of the 14th International Conference on Computational Linguistics (COLING- 92), 1992.

]. T. Winograd, Language as a Cognitive Process, 1983.

R. Xtag, . Group, . Xtag-research, and . Group, A lexicalized tree adjoining grammar for english, 2001.

]. G. Yang, An integrated approach to generation using systemic grammars and tree adjoining grammars, 1992.