Next Article in Journal
Binary Cockroach Swarm Optimization for Combinatorial Optimization Problem
Next Article in Special Issue
Theorietage der Gesellschaft für Informatik in Speyer 2015—Special Issue
Previous Article in Journal
Uniform Page Migration Problem in Euclidean Space
Previous Article in Special Issue
A Gentle Introduction to Applications of Algorithmic Metatheorems for Space and Circuit Classes
Article Menu

Export Article

Open AccessArticle
Algorithms 2016, 9(3), 58; doi:10.3390/a9030058

LR Parsing for LCFRS

Department for Computational Linguistics, Institute for Language and Information, Heinrich-Heine Universität Düsseldorf, Universitätsstr. 1, 40225 Düsseldorf, Germany
*
Author to whom correspondence should be addressed.
Academic Editor: Henning Fernau
Received: 21 March 2016 / Revised: 16 August 2016 / Accepted: 18 August 2016 / Published: 27 August 2016

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. View Full-Text
Keywords: parsing; automata; LCFRS parsing; automata; LCFRS
Figures

Figure 1

This is an open access article distributed under the Creative Commons Attribution License which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited. (CC BY 4.0).

Scifeed alert for new publications

Never 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

SciFeed Share & Cite This Article

MDPI and ACS Style

Kallmeyer, L.; Maier, W. LR Parsing for LCFRS. Algorithms 2016, 9, 58.

Show more citation formats Show less citations formats

Note that from the first issue of 2016, MDPI journals use article numbers instead of page numbers. See further details here.

Related Articles

Article Metrics

Article Access Statistics

1

Comments

[Return to top]
Algorithms EISSN 1999-4893 Published by MDPI AG, Basel, Switzerland RSS E-Mail Table of Contents Alert
Back to Top