Buch, Englisch, 201 Seiten, Previously published in hardcover, Format (B × H): 155 mm x 235 mm, Gewicht: 347 g
Reihe: The Springer International Series in Engineering and Computer Science
A Fast Algorithm for Practical Systems
Buch, Englisch, 201 Seiten, Previously published in hardcover, Format (B × H): 155 mm x 235 mm, Gewicht: 347 g
Reihe: The Springer International Series in Engineering and Computer Science
ISBN: 978-1-4419-5198-4
Verlag: Springer US
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).
Zielgruppe
Research
Autoren/Hrsg.
Fachgebiete
- Mathematik | Informatik EDV | Informatik Informatik Natürliche Sprachen & Maschinelle Übersetzung
- Geisteswissenschaften Sprachwissenschaft Computerlinguistik, Korpuslinguistik
- Mathematik | Informatik EDV | Informatik Informatik Künstliche Intelligenz Wissensbasierte Systeme, Expertensysteme
- Technische Wissenschaften Elektronik | Nachrichtentechnik Elektronik Robotik
Weitere Infos & Material
1. Introduction.- 2. Informal Description of the Algorithm.- 3. Examples.- 4. Formal Specification of the Algorithm.- 5. Comparison with Other Algorithms.- 6. Empirical Results.- 7. Left-to-Right on-Line Parsing.- 8. Sentence Disambiguation by Asking.- 9. Interactive/Personal Machine Translation.- 10. Concluding Remarks.- Appendix A. The Parsing Table Constructor.- Appendix B. Earley’s Algorithm.- Appendix C. Proof of Correctness of the Algorithm.- C.1. Introduction.- C.2. Soundness of the Algorithm.- C.3. Completeness of the Algorithm.- Appendix D. Raw Empirical Data.- Appendix E. Programs Used in the Experiments.- E.1. Tomita’s Algorithm.- E.2. Earley’s Algorithm.- E.3. Earley’s Algorithm with an Improvement.- E.4. LR(0) Table Construction Algorithm.- E.5. Utility Functions.- Appendix F. Grammars Used in the Experiments.- Appendix G. Sentences Used in the Experiments.- Appendix H. Nishida and Doshita’s System.- References.- Author Index.
