Efficient parsing with linear context-free rewriting systems

TY - CHAP

T1 - Efficient parsing with linear context-free rewriting systems

AU - van Cranenburgh, Andreas

N1 - Reporting year: 2012

PY - 2012

Y1 - 2012

N2 - 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.

AB - 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.

M3 - Contribution to conference proceedings

SP - 460

EP - 470

BT - Proceedings of the 13th Conference of the European Chapter of the Association for Computational Linguistics (EACL), Avignon, France

ER -