Parsing linear context-free rewriting systems
Paper in proceedings, 2005

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.


Peter Ljunglöf

University of Gothenburg

Håkan Burden

University of Gothenburg

IWPT'05, 9th International Workshop on Parsing Technologies

Subject Categories

Language Technology (Computational Linguistics)

More information

Latest update

3/2/2020 9