Abstract
We describe four different parsing algorithms for Linear Context-Free Rewriting Systems (Vijay-Shanker et al., 1987). The algorithms are described as deduction systems, and possible optimizations are discussed.
Cite
CITATION STYLE
APA
Burden, H., & Ljunglöf, P. (2005). Parsing linear context-free rewriting systems. In IWPT 2005 - Proceedings of the 9th International Workshop on Parsing Technologies (pp. 11–17). Association for Computational Linguistics (ACL). https://doi.org/10.3115/1654494.1654496
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
Already have an account? Sign in
Sign up for free