next up previous
Next: Viterbi parses Up: An Efficient Probabilistic Context-Free Previous: Complexity issues

Extensions

 

This section discusses extensions to the Earley algorithm that go beyond simple parsing and the computation of prefix and string probabilities. These extensions are all quite straightforward and well-supported by the original Earley chart structure, which leads us to view them as part of a single, unified algorithm for solving the tasks mentioned in the introduction.





Andreas Stolcke
Sat Jun 29 21:49:02 PDT 1996