Efficient parsing with linear context-free rewriting systems

Andreas van Cranenburgh

Onderzoeksoutput: Hoofdstuk in boek/boekdeelBijdrage aan conferentie proceedingsWetenschappelijkpeer 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.
Originele taal-2Engels
TitelProceedings of the 13th Conference of the European Chapter of the Association for Computational Linguistics (EACL), Avignon, France
StatusGepubliceerd - 2012


Duik in de onderzoeksthema's van 'Efficient parsing with linear context-free rewriting systems'. Samen vormen ze een unieke vingerafdruk.

Citeer dit