Skip to main content
  • 126 Accesses

Abstract

This book has described an efficient context-free parsing algorithm for natural languages, and has focussed on its practical value in natural language processing. The experiments have shown that this parsing algorithm seems significantly more efficient than Earley’s algorithm and perhaps any other general context-free parsing algorithms, as far as practical natural language processing is concerned.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD 109.99
Price excludes VAT (USA)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Author information

Authors and Affiliations

Authors

Rights and permissions

Reprints and permissions

Copyright information

© 1986 Springer Science+Business Media New York

About this chapter

Cite this chapter

Tomita, M. (1986). Concluding Remarks. 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_10

Download citation

  • DOI: https://doi.org/10.1007/978-1-4757-1885-0_10

  • Publisher Name: Springer, Boston, MA

  • Print ISBN: 978-1-4419-5198-4

  • Online ISBN: 978-1-4757-1885-0

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics