Abstract
One of the major characteristics of our algorithm is that an input sentence is parsed strictly from left to right. Although some other parsing algorithms, including Earley’s algorithm and breath-first ATN, also have this characteristic, only a few practical systems, if any, have taken advantage of it. Taking advantage of this left-to-right-ness, we have implemented on-line parsing on the basis of our parsing algorithm. The on-line parser starts parsing as soon as the user types in the first word of a sentence, without waiting for the end of line. In this section, we describe the benefits of instantiation of on-line parsing, and discuss some of its practical applications.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 1986 Springer Science+Business Media New York
About this chapter
Cite this chapter
Tomita, M. (1986). Left-to-Right On-Line Parsing. In: Efficient Parsing for Natural Language. The Springer International Series in Engineering and Computer Science, vol 8. Springer, Boston, MA. https://doi.org/10.1007/978-1-4757-1885-0_7
Download citation
DOI: https://doi.org/10.1007/978-1-4757-1885-0_7
Publisher Name: Springer, Boston, MA
Print ISBN: 978-1-4419-5198-4
Online ISBN: 978-1-4757-1885-0
eBook Packages: Springer Book Archive