TuLiPA - Parsing extensions of TAG with range concatenation grammars

• Autorzy: Kallmeyer L. , Maier W. , Parmentier Y. , Dellert J.
• Języki publikacji: EN

Abstrakty

EN

In this paper we present a parsing framework for extensions of Tree Adjoining Grammar (TAG) called TuLiPA (T¨ubingen Linguistic Parsing Architecture). In particular, besides TAG, the parser can process Tree-Tuple MCTAG with Shared Nodes (TT-MCTAG), a TAGextension which has been proposed to deal with scrambling in free word order languages such as German. The central strategy of the parser is such that the incoming TT-MCTAG (or TAG) is transformed into an equivalent Range Concatenation Grammar (RCG) which, in turn, is then used for parsing. The RCG parser is an incremental Earley-style chart parser. In addition to the syntactic anlysis, TuLiPA computes also an underspecified semantic analysis for grammars that are equipped with semantic representations.

Słowa kluczowe

EN

tree-adjoining grammar; parsing; range concatenation grammar

• Wydawca: Polska Akademia Nauk, Wydział IV Nauk Technicznych
• Czasopismo: Bulletin of the Polish Academy of Sciences. Technical Sciences
• Rocznik: 2010
• Tom: Vol. 58, nr 3
• Strony: 377--391
• Opis fizyczny: Bibliogr. 22 poz., rys.

Twórcy

autor

Kallmeyer L.

autor

Maier W.

autor

Parmentier Y.

autor

Dellert J.

• SFB 833, Universit¨at T¨ubingen, Nauklerstr. 35, D-72 074 T¨ubingen, Germany

Bibliografia

• [1] T. Lichte, “An MCTAG with tuples for coherent constructions in German”, Proc. 12th Conf. on Formal Grammar 2007 1, 1–12 (2007).
• [2] A.K. Joshi and Y. Schabes, “Tree-adjoning grammars”, Handbook of Formal Languages 1, 69–123 (1997).
• [3] S. Gorn, “Explicit definitions and linguistic dominoes”, Proc. Conf. held at University of Western Ontario and Systems and Computer Science 1, 77–115 (1967).
• [4] D. Weir, “Characterizing midly-context sensitive grammar formalisms”, PhD Thesis, University of Pennsylvania, Pennsylvania, 1988.
• [5] L. Kallmeyer, “Tree-local multicomponent tree adjoining grammars with shared nodes”, Computational Linguistics 31 (2), 187–225 (2005).
• [6] T. Lichte and L. Kallmeyer, “Factorizing complementation in a TT-MCTAG for German”, Proc. The Ninth Int. Workshop on Tree Adjoining Grammars and Related Formalisms (TAG+9) 1, 1–8 (2008).
• [7] L. Kallmeyer and Y. Parmentier, “On the relation between multicomponent tree adjoining grammars with tree tuples (TTMCTAG) and range concatenation grammars (RCG)”, Proc. 2nd Int. Conf. on Language and Automata Theory and Applications 5196, 263–274 (2008).
• [8] L. Kallmeyer and G. Satta, “A polynomial-time parsing algorithm for TT-MCTAG”, Proc. 47th Conf. Association for Computational Linguistics and the 4th Int. Joint Conf. on Natural Language Processing of the Asian Federation of NLP 1, 994–1002 (2009).
• [9] P. Boullier, “On TAG parsing”, Proc. TALN 99, 6e Conf. Annuelle sur le Traitement Automatique des Langues Naturelles 1, 75–84 (1999).
• [10] P. Boullier, “Range concatenation grammars”, Proc. Sixth Int. Workshop on Parsing Technologies 1, 53–64 (2000).
• [11] E. Bertsch and M.-J. Nederhof, “On the complexity of some extensions of RCG parsing”, Proc. Seventh Int. Workshop on Parsing Technologies 1, 66–77 (2001).
• [12] P. Boullier, “Proposal for a natural language processing syntactic backbone”, INRIA Research Report 3342, CD-ROM (1998).
• [13] P. Boullier, “On TAG and multi-component TAG parsing”, INRIA Research Report 3668, ftp://ftp.inria.fr/INRIA/publication/publi-pdf/RR/RR-3668.pdf (1999).
• [14] L. Kallmeyer and W. Maier, “An incremental Earley parser for simple range concatenation grammar”, Proc. 11th Int. Conf. on Parsing Technologies 1, 61–64 (2009).
• [15] L. Kallmeyer, W. Maier, and Y. Parmentier, “An Earley parsing algorithm for range concatenation grammar”, Proc. Short Papers of the 47th Conf. Association for Computational Linguistics and the 4th Int. Joint Conf. on Natural Language Processing of the Asian Federation of Natural Language Processing 1, 9–12 (2009).
• [16] ´E. Villemonte de La Clergerie, “Parsing mildly contextsensitive languages with thread automata”, Proc. 19th Int. Conf. on Computational Linguistics 1, 1–7 (2002).
• [17] C. Gardent and L. Kallmeyer, “Semantic construction in FTAG”, Proc. 10th Int. Conf. European Chapter of the Association for Computational Linguistics 1, 123–130 (2003).
• [18] D. Duchier, J. Le Roux, and Y. Parmentier, “An NLP application with a multi-paradigm architecture”, Proc. 2nd Mozart-Oz Conference 1, 175–187 (2004).
• [19] The XTAG research group, “A lexicalized tree adjoining grammar for English”, Institute for Research in Cognitive Science, Research Report, University of Pennsylvania, Pennsylvania, 2001.
• [20] A. Kinyon, “Hypertags”, Proc. 18th Int. Conf. on Computational Linguistics 1, 446–452 (2000).
• [21] G. Bonfante, B. Guillaume, and G. Perrier, “Polarization and abstraction of grammatical formalisms as methods for lexical disambiguation”, Proc. 20th Int. Conf. on Computational Linguistics 1, 303–309 (2004).
• [22] J. Bos, “Predicate logic unplugged”, Proc. Tenth Amsterdam Colloqium 1, 133–143 (1995).