LR parsing for LCFRS (Q1736827)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 7042367
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | LR parsing for LCFRS |
scientific article; zbMATH DE number 7042367 |
Statements
LR parsing for LCFRS (English)
0 references
26 March 2019
0 references
Summary: 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.
0 references
parsing
0 references
automata
0 references
LCFRS
0 references
0 references
0.7959596514701843
0 references
0.7848316431045532
0 references
0.7794502377510071
0 references
0.7764974236488342
0 references
