Efficient parsing with linear context-free rewriting systems

Andreas van Cranenburgh

Research output: Chapter in book/volumeContribution to conference proceedingsScientificpeer-review


Previous work on treebank parsing with discontinuous constituents using Linear Context-Free Rewriting systems (LCFRS) has been limited to sentences of up to 30 words, for reasons of computational complexity. There have been some results on binarizing an LCFRS in a manner that minimizes parsing complexity, but the present work shows that parsing long sentences with such an optimally binarized grammar remains infeasible. Instead, we introduce a technique which removes this length restriction, while maintaining a respectable accuracy. The resulting parser has been applied to a discontinuous treebank with favorable results.
Original languageEnglish
Title of host publicationProceedings of the 13th Conference of the European Chapter of the Association for Computational Linguistics (EACL), Avignon, France
Publication statusPublished - 2012


Dive into the research topics of 'Efficient parsing with linear context-free rewriting systems'. Together they form a unique fingerprint.

Cite this