TuLiPA - Parsing extensions of TAG with range concatenation grammars

被引:2
|
作者
Kallmeyer, L. [1 ]
Maier, W. [1 ]
Parmentier, Y. [2 ]
Dellert, J. [1 ]
机构
[1] Univ Tubingen, SFB 833, D-72074 Tubingen, Germany
[2] Univ Orleans, LIFO, F-45067 Orleans 2, France
关键词
tree adjoining grammar; parsing; range concatenation grammar; TREE-ADJOINING GRAMMARS;
D O I
10.2478/v10175-010-0036-0
中图分类号
T [工业技术];
学科分类号
08 ;
摘要
In this paper we present a parsing framework for extensions of Tree Adjoining Grammar (TAG) called TuLiPA (Tubingen 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
引用
收藏
页码:377 / 391
页数:15
相关论文
共 50 条
  • [41] CHART PARSING OF SCATTERED CONTEXT GRAMMARS
    POPOWICH, F
    APPLIED MATHEMATICS LETTERS, 1994, 7 (01) : 35 - 40
  • [42] PARSING AND GENERATION WITH STATIC DISCONTINUITY GRAMMARS
    DAHL, V
    POPOWICH, F
    NEW GENERATION COMPUTING, 1990, 8 (03) : 245 - 274
  • [43] The Computational Power of Parsing Expression Grammars
    Loff, Bruno
    Moreira, Nelma
    Reis, Rogerio
    DEVELOPMENTS IN LANGUAGE THEORY, DLT 2018, 2018, 11088 : 491 - 502
  • [44] Recursive descent parsing for Boolean grammars
    Alexander Okhotin
    Acta Informatica, 2007, 44 : 167 - 189
  • [45] Data Parsing using Tier Grammars
    Sakharov, Alexander
    Sakharov, Timothy
    2015 7TH INTERNATIONAL JOINT CONFERENCE ON KNOWLEDGE DISCOVERY, KNOWLEDGE ENGINEERING AND KNOWLEDGE MANAGEMENT (IC3K), 2015, : 463 - 468
  • [46] On the relation between context-free grammars and parsing expression grammars
    Mascarenhas, Fabio
    Medeiros, Sergio
    Ierusalimschy, Roberto
    SCIENCE OF COMPUTER PROGRAMMING, 2014, 89 : 235 - 250
  • [47] Tabular algorithms for TAG parsing
    Alonso, MA
    Cabrero, D
    de la Clergerie, E
    Vilares, M
    NINTH CONFERENCE OF THE EUROPEAN CHAPTER OF THE ASSOCIATION FOR COMPUTATIONAL LINGUISTICS, PROCEEDINGS, 1999, : 150 - 157
  • [48] Context-free graph grammars and concatenation of graphs
    Engelfriet, J
    Vereijken, JJ
    ACTA INFORMATICA, 1997, 34 (10) : 773 - 803
  • [49] Enhanced Universal Dependency Parsing with Automated Concatenation of Embeddings
    Wang, Xinyu
    Jia, Zixia
    Jiang, Yong
    Tu, Kewei
    IWPT 2021: THE 17TH INTERNATIONAL CONFERENCE ON PARSING TECHNOLOGIES: PROCEEDINGS OF THE CONFERENCE (INCLUDING THE IWPT 2021 SHARED TASK), 2021, : 189 - 195
  • [50] Context-free graph grammars and concatenation of graphs
    Joost Engelfriet
    Jan Joris Vereijken
    Acta Informatica, 1997, 34 : 773 - 803