Efficient Processing with Constraint-Logic Grammars Using Grammar CompilationGuido Minnen
This book investigates a number of practical problems in processing of written human language. More specifically, we propose a number techniques for automatic analysis and production of language using knowledge about the structure and meaning of human language in the form of constraint-logic grammars. The techniques proposed are all based on automatic grammar adaptation or compilation rather than a modification of the processing algorithm used. As such they allow the grammar writer to abstract over processing details and in many cases enable more efficient processing.
Guido Minnen is currently a staff scientist at the Human Interface Laboratory within Motorola Labs.
- Acknowledgements
- 1 Introduction
- 2 Processing with Constraint-logic Grammars
- 2.1 Constraint-logic Grammars
- 2.2 Processing with Constraint-logic Grammars
- 2.3 Summary
- I Syntactic Under-determination
- 3 Top-down Control and Syntactic Under-determination
- 3.1 Motivation
- 3.2 Adornments, Degrees of Non-determinism and Literal Arrangement
- 3.3 Literal Rearrangement
- 3.4 Limitations
- 3.5 Related Work
- 3.6 Summary
- 4 Top-down Control and Recursion on Structure
- 4.1 Motivation
- 4.2 Argument Sequences
- 4.3 Argument Sequences for Controlling Recursion on Structure
- 4.4 Building Recursion Reversal
- 4.5 Limitations
- 4.6 Related Work
- 4.7 Summary
- 5 Bottom-up Control using Magic
- 5.1 Motivation
- 5.2 Magic Transformation and Semi-naive Control
- 5.3 Refining Magic Transformation for Filter Improvement
- 5.4 Selective Magic Parsing
- 5.5 Related Work
- 5.6 Summary
- II Lexical Under-determination
- 6 Lexical Rules as Systematic Covariation in Lexical Entries
- 6.1 Motivation
- 6.2 Lexical Rules as Systemic Covariation in Lexical Entries
- 6.3 Limitations
- 6.4 Related Work
- 6.5 Summary
- 7 Optimized Covariation Lexica
- 7.1 Motivation
- 7.2 Word CLass Specialization of Frame Specification
- 7.3 Constraint Propagation for Efficient Lexical Lookup
- 7.4 Efficiency Evaluation
- 7.5 Limitations
- 7.6 Related Work
- 7.7 Summary
- 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
2/1/2001
ISBN (Paperback): 1575863065 (9781575863061)
ISBN (Cloth): 1575863057 (9781575863054)
ISBN (Electronic): 1684000114 (9781684000111)
Subject: Linguistics; Constraint Programming; Logic Programming
|
Distributed by the University of Chicago Press
|