Quadratic Complexity

In this paper, we extend methods from Roark and Hollingshead (2008) for reducing the worst-case complexity of a context-free pars- ing pipeline via hard constraints derived from finite-state tagging pre-processing. …...