Advertisement

Comparison with Other Algorithms

  • Masaru Tomita
Chapter
Part of the The Springer International Series in Engineering and Computer Science book series (SECS, volume 8)

Abstract

There have been several general parsing algorithms that run in polynomial time. Theoretically speaking, the fastest algorithm at present is Valiant’s algorithm. Valiant [55] reduced the context-free parsing problem to the Boolean Matrix Multiplication problem [22], 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.

Keywords

Parse Tree Input Sentence Parsing Algorithm Chart Parsing Chomsky Normal Form 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer Science+Business Media New York 1986

Authors and Affiliations

  • Masaru Tomita
    • 1
  1. 1.Carnegie-Mellon UniversityUSA

Personalised recommendations