Klein, Dan and Manning, Christopher D. (2002) A* Parsing: Fast Exact Viterbi Parse Selection. Technical Report. Stanford.
A$^*$ PCFG parsing can dramatically reduce the time required to find the exact Viterbi parse by conservatively estimating outside Viterbi probabilities. We discuss various estimates and give efficient algorithms for computing them. On Penn treebank sentences, our most detailed estimate reduces the total number of edges processed to less than 3% of that required by exhaustive parsing, and even a simpler estimate which can be pre-computed in under a minute still reduces the work by a factor of 5. The algorithm extends the classic A* graph search procedure to a certain hypergraph associated with parsing. Unlike best-first and finite-beam methods for achieving this kind of speed-up, the A$^*$ parser is guaranteed to return the most likely parse, not just an approximation. The algorithm is also correct for a wide range of parser control strategies and maintains a worst-case cubic time bound.
|Item Type:||Techreport (Technical Report)|
|Uncontrolled Keywords:||nlp, parsing, probabilistic parsing, a*, a star|
|Related URLs:||Project Homepage||http://www-nlp.stanford.edu/|
|Deposited By:||Import Account|
|Deposited On:||03 Mar 2002 16:00|
|Last Modified:||25 Dec 2008 09:39|
Repository Staff Only: item control page