Abstract Coarse-to-Fine Efficient Viterbi Parsing

We present Coarse-to-Fine (CTF), a probabilistic parsing algorithm that performs exact inference on complex, high-accuracy parsing models. Exact inference on these models is computationally expensive, while solving simpler models is efficient and produces respectable results. CTF solves a series of increasingly complex models by using the solutions of simpler models to guide optimal parse tree search in a more complex model space. We compare our results with the CYK and A * algorithms and find that our current implementation of CTF traverses the smallest amount of complex model space, but fails to gain a significant advantage in computational efficiency.