 |
|
|
|
| HAL: hal-00460709, version 1 |
| Detailed view |  Export this paper |
|
|
| Bulletin of the Polish Academy of Sciences : Technical Sciences 58, 3 (2010) 377-392 |
|
|
|
|
| TuLiPA - Parsing Extensions of TAG with Range Concatenation Grammars |
|
|
| Laura Kallmeyer 1Wolfgang Maier 1 |
|
|
| (2010) |
|
|
|
| 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 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. |
|
|
|
|
|
|
|
|
|
|
|
| 1: | Emmy Noether Project (SFB 833) |
|
|
|
Tübingen Universität - Tübingen University |
|
|
| 2: | Laboratoire d'Informatique Fondamentale d'Orléans (LIFO) |
|
|
|
Université d'Orléans : EA4022 – Ecole Nationale Supérieure d'Ingénieurs de Bourges |
|
|
|
|
|
|
|
|
|
| CA |
|
|
|
|
| Subject | : | Computer Science/Computation and Language |
|
|
| natural language processing – parsing – tree-based grammar – range concatenation grammar |
|
| hal-00460709, version 1 | |
| http://hal.archives-ouvertes.fr/hal-00460709 | |
| oai:hal.archives-ouvertes.fr:hal-00460709 | |
| From: Yannick Parmentier | |
| Submitted on: Tuesday, 2 March 2010 10:48:28 | |
| Updated on: Wednesday, 6 October 2010 10:31:29 | |
