TuLiPA - Parsing Extensions of TAG with Range Concatenation Grammars

Laura Kallmeyer (1) , Wolfgang Maier (1) , Yannick Parmentier (2) , Johannes Dellert (1)

1 SFB 833 - Emmy Noether Project
2 TALARIS - Natural Language Processing: representation, inference and semantics

In this paper we present a parsing framework for extensions of Tree Adjoining Grammars (TAG) called TuLiPA (Tuebingen Linguistic Parsing Architecture). In particular, besides TAG, the parser can process Tree-Tuple MCTAG with shared nodes (TT-MCTAG), a TAG-extension that 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.

Domains: Computation and Language [cs.CL]

Laura Kallmeyer, Wolfgang Maier, Yannick Parmentier, Johannes Dellert. TuLiPA - Parsing Extensions of TAG with Range Concatenation Grammars. First Polish-German Workshop on Research Cooperation in Computer Science, Jun 2009, Cracow, Poland. ⟨inria-00447653⟩