DFKI-LT - Parsing Non-Recursive Context-Free Grammars

Mark-Jan Nederhof, Giorgio Satta
Parsing Non-Recursive Context-Free Grammars
1 40th Annual Meeting of the Association for Computational Linguistics, Proceedings of the Conference, Pages 112-119, Philadelphia, Pennsylvania, USA, o.A., 2002
 
We consider the problem of parsing non-recursive context-free grammars, i.e., context-free grammars that generate finite languages. In natural language processing, this problem arises in several areas of application, including natural language generation, speech recognition and machine translation. We present two tabular algorithms for parsing of non-recursive context-free grammars, and show that they perform well in practical settings, despite the fact that this problem is PSPACE-complete.
 
Files: BibTeX, nederhof02d.pdf, nederhof02d.ps