A Constraint Driven Metagrammar

We present an operational framework allowing to express a large scale Tree Adjoining Grammar (tag) by using higher level operational constraints on tree descriptions. These constraints first meant to guarantee the well formedness of the grammatical units may also be viewed as a way to put model theoretic syntax at work through an efficient offline grammatical compilation process. Our strategy preserves tag formal properties, hence ensures a reasonable processing efficiency.

[1]  Robert Frank,et al.  Phrase Structure Composition and Syntactic Dependencies , 2002, Computational Linguistics.

[2]  Fei Xia,et al.  Automatic grammar generation from two different perspectives , 2001 .

[3]  Benoit Crabbé.  Grammatical Development with Xmg , 2005, LACL.

[4]  Hassan Aït-Kaci,et al.  Warren's Abstract Machine: A Tutorial Reconstruction , 1991 .

[5]  Ralph Debusmann,et al.  Extensible Dependency Grammar: A New Methodology , 2004, Workshop On Recent Advances In Dependency Grammar.

[6]  Bertrand Gaiffe,et al.  A new metagrammar compiler , 2002, TAG+.

[7]  Marie Candito.  Organisation modulaire et parametrable de grammaires electroniques lexicalisees application du francais et a l'italien , 1999 .

[8]  Fernando Pereira,et al.  Definite clause grammars for language analysis , 1986 .

[9]  Joseph Le Roux,et al.  The Metagrammar Compiler: An NLP Application with a Multi-paradigm Architecture , 2004, MOZ.

[10]  Joachim Niehren,et al.  Dominance Constraints with Set Operators , 2000, Computational Logic.

[11]  James Rogers,et al.  OBTAINING TREES FROM THEIR DESCRIPTIONS: AN APPLICATION TO TREE‐ADJOINING GRAMMARS , 1994, Comput. Intell..

[12]  M. Baltin,et al.  The Mental representation of grammatical relations , 1985 .

[13]  David M. Perlmutter.  Deep and surface structure constraints in syntax , 1973 .

[14]  Anne Abeillé,et al.  Une grammaire electronique du franais , 2003 .

[15]  G. Perrier,et al.  Les grammaires d'interaction , 2003 .