XMG: eXtensible MetaGrammar

In this article, we introduce eXtensible MetaGrammar (XMG), a framework for specifying tree-based grammars such as Feature-Based Lexicalized Tree-Adjoining Grammars (FB-LTAG) and Interaction Grammars (IG). We argue that XMG displays three features that facilitate both grammar writing and a fast prototyping of tree-based grammars. Firstly, XMG is fully declarative. For instance, it permits a declarative treatment of diathesis that markedly departs from the procedural lexical rules often used to specify tree-based grammars. Secondly, the XMG language has a high notational expressivity in that it supports multiple linguistic dimensions, inheritance, and a sophisticated treatment of identifiers. Thirdly, XMG is extensible in that its computational architecture facilitates the extension to other linguistic formalisms. We explain how this architecture naturally supports the design of three linguistic formalisms, namely, FB-LTAG, IG, and Multi-Component Tree-Adjoining Grammar (MC-TAG). We further show how it permits a straightforward integration of additional mechanisms such as linguistic and formal principles. To further illustrate the declarativity, notational expressivity, and extensibility of XMG, we describe the methodology used to specify an FB-LTAG for French augmented with a unification-based compositional semantics. This illustrates both how XMG facilitates the modeling of the tree fragment hierarchies required to specify tree-based grammars and of a syntax/semantics interface between semantic representations and syntactic trees. Finally, we briefly report on several grammars for French, English, and German that were implemented using XMG and compare XMG with other existing grammar specification frameworks for tree-based grammars.

[1]  Laura Kallmeyer,et al.  XMG: eXtending MetaGrammars to MCTAG , 2007 .

[2]  Claire Gardent,et al.  SemTAG: a platform for specifying Tree Adjoining Grammars and performing TAG-based Semantic Construction , 2007, ACL.

[3]  Denys Duchier,et al.  Metagrammars as Logic Programs , 2012 .

[4]  Stefan Thater,et al.  Parsing with Tree Descriptions: a constraint-based approach , 1999 .

[5]  Claire Gardent,et al.  Large Scale Semantic Construction for Tree Adjoining Grammars , 2005, LACL.

[6]  K. Vijay-Shanker,et al.  Structure Sharing in Lexicalized Tree-Adjoining Grammars , 1992, COLING.

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

[8]  Claire Gardent Tree Adjoining Grammar , Semantic Calculi and Labelling Invariants , 2006 .

[9]  Denys Duchier,et al.  Describing Morphologically-rich Languages using Metagrammars: a Look at Verbs in Ikota , 2012 .

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

[11]  Laura Kallmeyer,et al.  LTAG Semantics with Semantic Unification , 2004, TAG+.

[12]  Shuly Wintner,et al.  Towards Modular Development of Typed Unification Grammars , 2011, CL.

[13]  David J. Weir,et al.  Encoding Lexicalized Tree Adjoining Grammars with a Nonmonotonic Inheritance Hierachy , 1995, ACL.

[14]  Aravind K. Joshi,et al.  Tree Adjunct Grammars , 1975, J. Comput. Syst. Sci..

[15]  Guy Perrier-LORIA A French Interaction Grammar , 2006 .

[16]  David H. D. Warren,et al.  Definite Clause Grammars for Language Analysis - A Survey of the Formalism and a Comparison with Augmented Transition Networks , 1980, Artif. Intell..

[17]  David J. Weir,et al.  Characterizing mildly context-sensitive grammar formalisms , 1988 .

[18]  Alexandra Kinyon,et al.  Generating Parallel Multilingual LFG-TAG Grammars from a MetaGrammar , 2003, ACL.

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

[20]  Yannick Parmentier,et al.  SemTAG : une plate-forme pour le calcul sémantique à partir de Grammaires d'Arbres Adjoints. (SemTAG: a platform for semantic construction with Tree Adjoining Grammars) , 2007 .

[21]  David J. Weir,et al.  D-Tree Grammars , 1995, ACL.

[22]  Fei Xia,et al.  Developing Tree-Adjoining Grammars with Lexical Descriptions , 2007 .

[23]  Johan Bos,et al.  Learn Prolog Now , 2006 .

[24]  Alexandra Kinyon Hypertags , 2000, COLING.

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

[26]  Shuly Wintner,et al.  The Non-associativity of Polarized Tree-Based Grammars , 2007, CICLing.

[27]  Aravind K. Joshi,et al.  Feature Structures Based Tree Adjoining Grammars , 1988, COLING.

[28]  Éric Villemonte de la Clergerie Building factorized TAGs with meta-grammars , 2010, TAG.

[29]  Claire Gardent Integrating a Unification-Based Semantics in a Large Scale Lexicalised Tree Adjoining Grammar for French , 2008, COLING.

[30]  李幼升,et al.  Ph , 1989 .

[31]  Kepa Sarasola,et al.  Language Technology for Normalisation of Less-Resourced Languages , 2012, LREC 2012.

[32]  Shuly Wintner,et al.  Associative Grammar Combination Operators for Tree-Based Grammars , 2009, J. Log. Lang. Inf..

[33]  D. Flickinger Lexical rules in the hierarchical lexicon , 1989 .

[34]  Bruno Guillaume,et al.  Interaction Grammars , 2009 .

[35]  Ronald M. Kaplan,et al.  Lexical Resource Reconciliation in the Xerox Linguistic Environment , 1997, Workshop On Computational Environments For Grammar Development And Linguistic Engineering.

[36]  Marie-Hélène Candito,et al.  A principle-based hierarchical representation of LTAGs , 1996, COLING.

[37]  Anne Abeillé,et al.  FTAG : current status and parsing scheme , 1999 .

[38]  Igor Mel’čuk,et al.  Establishing an inventory of surface-syntactic relations: Valence-controlled surface-syntactic dependents of the verb in French , 2009 .

[39]  Laura Kallmeyer,et al.  Scope and Situation Binding in LTAG Using Semantic Unification , 2008 .

[40]  Shashi Narayan,et al.  Multiple Adjunction in Feature-Based Tree-Adjoining Grammar , 2015, CL.

[41]  Lorna Balkan,et al.  TSNLP - Test Suites for Natural Language Processing , 1996, COLING.

[42]  Van Roy,et al.  Extended DCG Notation: A Tool for Applicative Programming in Prolog , 1990 .

[43]  Claire Gardent,et al.  A Symbolic Approach to Near-Deterministic Surface Realisation using Tree Adjoining Grammar , 2007, ACL.

[44]  Carlos Augusto Prolo,et al.  Generating the XTAG English Grammar Using Metarules , 2002, COLING.

[45]  Jason Baldridge,et al.  DotCCG and VisCCG: Wiki and Programming Paradigms for Improved Grammar Engineering with OpenCCG , 2007 .

[46]  Sébastien Barrier,et al.  Une métagrammaire pour les noms prédicatifs du français , 2003, JEPTALNRECITAL.

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

[48]  Laura Kallmeyer,et al.  Semantic construction in feature-based TAG , 2003 .

[49]  Dan Flickinger,et al.  An Open Source Grammar Development Environment and Broad-coverage English Grammar Using HPSG , 2000, LREC.

[50]  Alexandra Kinyon,et al.  The Metagrammar Goes Multilingual: A Cross-Linguistic Look at the V2-Phenomenon , 2006, TAG.

[51]  Alex Lascarides,et al.  An Algebra for Semantic Construction in Constraint-based Grammars , 2001, ACL.

[52]  Laura Kallmeyer,et al.  Developing a TT-MCTAG for German with an RCG-based Parser , 2008, LREC.

[53]  Stuart M. Shieber The design of a computer language for linguistic information , 1984 .

[54]  Denys Duchier,et al.  Metagrammar Redux , 2004, CSLP.

[55]  M. Yüksel,et al.  A Ph.D. Thesis , 2014 .

[56]  Anne Abeillé,et al.  A Lexicalized Tree Adjoining Grammar for English , 1990 .

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

[58]  Laura Kallmeyer,et al.  Tree description grammars and underspecified representations , 1999 .

[59]  Emiel Krahmer,et al.  Description theory, LTAGs and underspecified semantics , 1998, TAG+.

[60]  Fei Xia,et al.  AUTOMATICALLY GENERATING TREE ADJOINING GRAMMARS FROM ABSTRACT SPECIFICATIONS , 2005, Comput. Intell..

[61]  Laura Kallmeyer,et al.  LTAG Semantics for Questions , 2004, TAG+.

[62]  Laura Kallmeyer,et al.  TuLiPA - Parsing Extensions of TAG with Range Concatenation Grammars , 2009 .

[63]  Guy Perrier Interaction Grammars , 2000, COLING.

[64]  Timm Lichte,et al.  1 An MCTAG with Tuples for Coherent Constructions in German , 2007 .

[65]  Claire Gardent,et al.  Coreference Handling in XMG , 2006, ACL.

[66]  Philipp Cimiano,et al.  Ontology-Based Interpretation of Natural Language , 2014, Ontology-Based Interpretation of Natural Language.

[67]  Martha Palmer,et al.  Towards Semi-automating Grammar Development , 2009 .

[68]  XTAG Research Group,et al.  A Lexicalized Tree Adjoining Grammar for English , 1998, ArXiv.

[69]  Srinivas Bangalore,et al.  Supertagging: Using Complex Lexical Descriptions in Natural Language Processing , 2010 .

[70]  Jessie Pinkham,et al.  Une grammaire électronique du français , 2003 .

[71]  Laura Kallmeyer,et al.  Tree-Local Multicomponent Tree-Adjoining Grammars with Shared Nodes , 2005, Computational Linguistics.