Optimal Incremental Parsing via Best-First Dynamic Programming

  title={Optimal Incremental Parsing via Best-First Dynamic Programming},
  author={Kai Zhao and James Cross and Liang Huang},
We present the first provably optimal polynomial time dynamic programming (DP) algorithm for best-first shift-reduce parsing, which applies the DP idea of Huang and Sagae (2010) to the best-first parser of Sagae and Lavie (2006) in a non-trivial way, reducing the complexity of the latter from exponential to polynomial. We prove the correctness of our algorithm rigorously. Experiments confirm that DP leads to a significant speedup on a probablistic best-first shift-reduce parser, and makes exact… CONTINUE READING
11 Citations
17 References
Similar Papers


Publications citing this paper.
Showing 1-10 of 11 extracted citations

Similar Papers

Loading similar papers…