Title: Efficient parsing with Linear Context-Free Rewriting Systems
Abstract: 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.
Publication Year: 2012
Publication Date: 2012-04-23
Language: en
Type: article
Access and Citation
Cited By Count: 25
AI Researcher Chatbot
Get quick answers to your questions about the article from our AI researcher chatbot