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 条
12345