Abstract
Parsing is a computationally intensive task due to the combinatorial explosion seen in chart parsing algorithms that explore possible parse trees. In this paper, we propose a method to limit the combinatorial explosion by restricting the CYK chart parsing algorithm based on the output of a chunk parser. When tested on the three parsers presented in (Collins, 1999), we observed an approximate three-fold speedup with only an average decrease of 0.17% in both precision and recall.
Cite
CITATION STYLE
Glaysher, E., & Moldovan, D. (2006). Speeding up full syntactic parsing by leveraging partial parsing decisions. In COLING/ACL 2006 - 21st International Conference on Computational Linguistics and 44th Annual Meeting of the Association for Computational Linguistics, Proceedings of the Main Conference Poster Sessions (pp. 295–300). Association for Computational Linguistics (ACL). https://doi.org/10.3115/1273073.1273111
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.