LR Parsing for LCFRS

被引：2
|
作者：
Kallmeyer, Laura [1 ]
Maier, Wolfgang [1 ]
机构：
[1] Univ Dusseldorf, Inst Language & Informat, Dept Computat Linguist, Univ Str 1, D-40225 Dusseldorf, Germany
来源：
ALGORITHMS | 2016年 / 9卷 / 03期
关键词：
parsing; automata; LCFRS;
D O I：
10.3390/a9030058
中图分类号：
TP18 [人工智能理论];
学科分类号：
081104 ; 0812 ; 0835 ; 1405 ;
摘要：
LR parsing is a popular parsing strategy for variants of Context-Free Grammar (CFG). It has also been used for mildly context-sensitive formalisms, such as Tree-Adjoining Grammar. In this paper, we present the first LR-style parsing algorithm for Linear Context-Free Rewriting Systems (LCFRS), a mildly context-sensitive extension of CFG which has received considerable attention in the last years in the context of natural language processing.
引用
收藏
页数：28
相关论文
共 50 条
  • [1] Span-Based LCFRS-2 Parsing
    Stanojevic, Milos
    Steedman, Mark
    16TH INTERNATIONAL CONFERENCE ON PARSING TECHNOLOGIES AND IWPT 2020 SHARED TASK ON PARSING INTO ENHANCED UNIVERSAL DEPENDENCIES, 2020, : 111 - 121
  • [2] SCHEME FOR LR(K) PARSING WITH ERROR RECOVERY .1. LR(K) PARSING
    SIPPU, S
    SOISALONSOININEN, E
    INTERNATIONAL JOURNAL OF COMPUTER MATHEMATICS, 1980, 8 (01) : 27 - 42
  • [3] PARALLEL INCREMENTAL LR PARSING
    VISWANATHAN, N
    SRIKANT, YN
    COMPUTER LANGUAGES, 1994, 20 (03): : 151 - 175
  • [4] On LR Parsing with Selective Delays
    Bertsch, Eberhard
    Nederhof, Mark-Jan
    Schmitz, Sylvain
    COMPILER CONSTRUCTION, CC 2013, 2013, 7791 : 244 - 263
  • [5] VERY FAST LR PARSING
    PENNELLO, TJ
    SIGPLAN NOTICES, 1986, 21 (07): : 145 - 151
  • [6] LR parsing for conjunctive grammars
    Okhotin, Alexander
    Grammars, 2002, 5 (02): : 81 - 124
  • [7] SUFFIX LANGUAGES IN LR PARSING
    SEYFARTH, BR
    BERMUDEZ, ME
    INTERNATIONAL JOURNAL OF COMPUTER MATHEMATICS, 1995, 55 (3-4) : 135 - 153
  • [8] LR PARSING OF CFGS WITH RESTRICTIONS
    MCKENZIE, BJ
    SOFTWARE-PRACTICE & EXPERIENCE, 1990, 20 (08): : 823 - 832
  • [9] LR-PARSING DERIVED
    HESSELINK, WH
    SCIENCE OF COMPUTER PROGRAMMING, 1992, 19 (02) : 171 - 196
  • [10] LR parsing for Boolean grammars
    Okhotin, A
    DEVELOPMENTS IN LANGUAGE THEORY, PROCEEDINGS, 2005, 3572 : 362 - 373
12345