Efficient Processing with Constraint-Logic Grammars Using Grammar
9781684000111
Distributed for Center for the Study of Language and Information
Efficient Processing with Constraint-Logic Grammars Using Grammar
The ascendance of communication technologies such as the internet has accentuated the need to improve access, manipulation and translation of written language. One of the main goals of researchers in the field of computational linguistics is to create programs that put to use knowledge of human language in pursuit of technology that can overcome the many obstacles in the interaction between human and computer. In this endeavor, finding automated techniques to parse the complexities of human grammar is a premier problem tackled by human-interface researchers. The intricacy of human grammar poses problems not only of accuracy, but also of efficiency.
This book investigates programs for automatic analysis and production of written human language. These specialized programs use knowledge about the structure and meaning of human language in the form of grammars. Various techniques are proposed which focus on solutions for practical problems in processing of constraint-logic grammars. The solutions are all based on the automatic adaptation or compilation of a grammar rather than a modification of the processing algorithm used. As such they allow the grammar writer to abstract over details of grammar processing and in many cases enable more efficient processing.
This book investigates programs for automatic analysis and production of written human language. These specialized programs use knowledge about the structure and meaning of human language in the form of grammars. Various techniques are proposed which focus on solutions for practical problems in processing of constraint-logic grammars. The solutions are all based on the automatic adaptation or compilation of a grammar rather than a modification of the processing algorithm used. As such they allow the grammar writer to abstract over details of grammar processing and in many cases enable more efficient processing.
6 x 9 | © 2001
Stanford Monographs in Linguistics
Language and Linguistics: Formal Logic and Computational Linguistics
Table of Contents
Acknowledgements
1. Introduction
2. Processing with Constraint-logic Grammars
I: Syntactic Under-determination
3. Top-down Control and Syntactic Under-determination
4. Top-down Control and Recursion on Structure
5. Bottom-up Control using Magic
II: Lexical Under-determination
6. Lexical Rules as Systematic Covariation in Lexical Entries
7. Optimized Covariation Lexica
8. Conclusion
Appendix A: HPSG Signature
Appendix B: Argument Sequence Computation
Appendix C: Selective Magic Transformation
Appendix D: HPSG Linearization Grammar of German
Appendix E: Frame Computation
References
Index
1. Introduction
2. Processing with Constraint-logic Grammars
I: Syntactic Under-determination
3. Top-down Control and Syntactic Under-determination
4. Top-down Control and Recursion on Structure
5. Bottom-up Control using Magic
II: Lexical Under-determination
6. Lexical Rules as Systematic Covariation in Lexical Entries
7. Optimized Covariation Lexica
8. Conclusion
Appendix A: HPSG Signature
Appendix B: Argument Sequence Computation
Appendix C: Selective Magic Transformation
Appendix D: HPSG Linearization Grammar of German
Appendix E: Frame Computation
References
Index
Be the first to know
Get the latest updates on new releases, special offers, and media highlights when you subscribe to our email lists!