Comparison with Other Algorithms
There have been several general parsing algorithms that run in polynomial time. Theoretically speaking, the fastest algorithm at present is Valiant’s algorithm. Valiant  reduced the context-free parsing problem to the Boolean Matrix Multiplication problem , and his algorithm runs in time O(n2.81). This algorithm is, however, of only theoretical interest, because the coefficient of n2.81 is so large that the algorithm runs faster than conventional n3 algorithms only when an input sentence is tremendously long. Practically speaking, on the other hand, the most well-known parsing algorithm is Earley’s algorithm [21, 20, 1, 25], which runs in time O(n3). This book compares our algorithm mainly with this algorithm.
KeywordsParse Tree Input Sentence Parsing Algorithm Chart Parsing Chomsky Normal Form
Unable to display preview. Download preview PDF.