TuLiPA - Parsing extensions of TAG with range concatenation grammars

In this paper we present a parsing framework for extensions of Tree Adjoining Grammar (TAG) called TuLiPA (Tübingen Linguistic Parsing Architecture). In particular, besides TAG, the parser can process Tree-Tuple MCTAG with Shared Nodes (TT-MCTAG), a TAG-extension which has been proposed to deal with...

Full description

Saved in:
Bibliographic Details
Published in:Bulletin of the Polish Academy of Sciences. Technical sciences 2010-09, Vol.58 (3), p.377-391
Main Authors: Kallmeyer, L., Maier, W., Parmentier, Y., Dellert, J.
Format: Article
Language:English
Subjects:
Computation and Language
Computer Science
parsing
range concatenation grammar
tree-adjoining grammar
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:In this paper we present a parsing framework for extensions of Tree Adjoining Grammar (TAG) called TuLiPA (Tübingen Linguistic Parsing Architecture). In particular, besides TAG, the parser can process Tree-Tuple MCTAG with Shared Nodes (TT-MCTAG), a TAG-extension 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.
ISSN:0239-7528
2300-1917
2300-1917
0239-7528
DOI:10.2478/v10175-010-0036-0