Speeding Up Full Syntactic Parsing by Leveraging Partial Parsing Decisions

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

• Type: Conference
• Year: 2006
• Where: ACL
• Authors: Elliot Glaysher, Dan I. Moldovan
• Keywords: ACL 2006, ACL 2007, Chart Parsing Algorithm, Combinatorial Explosion, Possible Parse Trees