BIBLIO is the largest independent book marketplace in the world, with over 100 million books.

Skip to content

Efficient Parsing for Natural Language: A Fast Algorithm for Practical Systems (The Springer International Series in Engineering and Computer Science, 8)

Efficient Parsing for Natural Language: A Fast Algorithm for Practical Systems (The Springer International Series in Engineering and Computer Science, 8)

Efficient Parsing for Natural Language: A Fast Algorithm for Practical Systems
Stock photo: cover may vary

Efficient Parsing for Natural Language: A Fast Algorithm for Practical Systems (The Springer International Series in Engineering and Computer Science, 8) Hardback - 1985

by Tomita, Masaru

Add to wish list
  • Used
  • Good
  • Hardback
Used - Good

Description

hardcover. Good. Access codes and supplements are not guaranteed with used items. May be an ex-library book.
Ask the seller a question Add to wish list
A$88.30
Free Delivery within USA
Standard delivery: 7 to 14 days
More delivery options
Dropship order
Ships from Bonita (California, United States)

Details

About Bonita California, United States

Biblio member since 2020

Terms of Sale: 30 day return guarantee, with full refund including original shipping costs for up to 30 days after delivery if an item arrives misdescribed or damaged.

Browse books from Bonita

Reader reviews for Efficient Parsing for Natural Language: A Fast Algorithm for Practical Systems (The Springer International Series in Engineering and Computer Science, 8)

From the publisher

Parsing Efficiency is crucial when building practical natural language systems. 'Ibis is especially the case for interactive systems such as natural language database access, interfaces to expert systems and interactive machine translation. Despite its importance, parsing efficiency has received little attention in the area of natural language processing. In the areas of compiler design and theoretical computer science, on the other hand, parsing algorithms 3 have been evaluated primarily in terms of the theoretical worst case analysis (e.g. lXn , and very few practical comparisons have been made. This book introduces a context-free parsing algorithm that parses natural language more efficiently than any other existing parsing algorithms in practice. Its feasibility for use in practical systems is being proven in its application to Japanese language interface at Carnegie Group Inc., and to the continuous speech recognition project at Carnegie-Mellon University. This work was done while I was pursuing a Ph.D degree at Carnegie-Mellon University. My advisers, Herb Simon and Jaime Carbonell, deserve many thanks for their unfailing support, advice and encouragement during my graduate studies. I would like to thank Phil Hayes and Ralph Grishman for their helpful comments and criticism that in many ways improved the quality of this book. I wish also to thank Steven Brooks for insightful comments on theoretical aspects of the book (chapter 4, appendices A, B and C), and Rich Thomason for improving the linguistic part of tile book (the very beginning of section 1.1).
tracking-