LR Parsing for LCFRS
AbstractLR 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. View Full-Text
Scifeed alert for new publicationsNever miss any articles matching your research from any publisher
- Get alerts for new papers matching your research
- Find out the new papers from selected authors
- Updated daily for 49'000+ journals and 6000+ publishers
- Define your Scifeed now
Kallmeyer, L.; Maier, W. LR Parsing for LCFRS. Algorithms 2016, 9, 58.
Kallmeyer L, Maier W. LR Parsing for LCFRS. Algorithms. 2016; 9(3):58.Chicago/Turabian Style
Kallmeyer, Laura; Maier, Wolfgang. 2016. "LR Parsing for LCFRS." Algorithms 9, no. 3: 58.
Note that from the first issue of 2016, MDPI journals use article numbers instead of page numbers. See further details here.