Speeding up full syntactic parsing by leveraging partial parsing decisions
Elliot Glaysher, DAN I. MOLDOVAN · 2006
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.