Exponential to Polynomial Complexity
otherentity
ID: exponentialtopolynomialcomplexity
Related Papers
Optimal Incremental Parsing via Best-First Dynamic Programming
We present the first provably optimal polyno- mial time dynamic programming (DP) algo- rithm for best-first shift-reduce parsing, which applies the DP idea of Huang and Sagae (2010) to the …...