2016
DOI: 10.3390/a9030058
|View full text |Cite
|
Sign up to set email alerts
|

LR Parsing for LCFRS

Abstract: 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.

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1

Citation Types

0
1
0

Year Published

2016
2016
2022
2022

Publication Types

Select...
2
2

Relationship

0
4

Authors

Journals

citations
Cited by 4 publications
(1 citation statement)
references
References 31 publications
(35 reference statements)
0
1
0
Order By: Relevance
“…From an empirical point of view, a transition system that overgenerates is necessary for robustness, and is desirable for fast approximate linear-time inference. However, from a formal point of view, the relationship of the SR-GAP transition system with automata explicitly designed for LCFRS parsing (Villemonte de La Clergerie, 2002;Kallmeyer and Maier, 2015) requires further investigations.…”
Section: Completeness and Soundnessmentioning
confidence: 99%
“…From an empirical point of view, a transition system that overgenerates is necessary for robustness, and is desirable for fast approximate linear-time inference. However, from a formal point of view, the relationship of the SR-GAP transition system with automata explicitly designed for LCFRS parsing (Villemonte de La Clergerie, 2002;Kallmeyer and Maier, 2015) requires further investigations.…”
Section: Completeness and Soundnessmentioning
confidence: 99%