Preface. 1: Developments in Parsing Technology: From Theory to Application, H. Bunt, J. Carroll, G. Satta Introduction About this book. 2: Parameter Estimation for Statistical Parsing Models: Theory and Practice of Distribution-Free Methods, M. Collins Introduction Linear Models Probabilistic Context-Free Grammars Statistical Learning Theory Convergence Bounds for Finite Sets of Hypotheses Convergence Bounds for Hyperplane Classifiers Application of Margin Analysis to Parsing Algorithms Discussion Conclusions. 3: High Precision Extraction of Grammatical Relations, J. Carroll, T. Briscoe Introduction The Analysis System Empirical Results Conclusions and Further Work. 4: Automated Extraction of TAGs from the Penn Treebank, J. Chen, K.V. Shanker Introduction Tree Extraction Procedure Evaluation Extended Extracted Grammars Related Work Conclusions. 5: Computing the Most Probable Parse for a Discontinuous Phrase-Structure Grammar, O. Plaehn Introduction Discontinuous Phrase-Structure Grammar The Parsing Algorithm Computing the Most Probable Parse Experiments Conclusion and Future Work. 6: A Neural Network Parser that Handles Sparse Data, J. Henderson Introduction Simple Synchrony Networks A Probabilistic Parser for SSNs Estimating the Probabilities with a Simple Synchrony Network Generalizing from Sparse Data Conclusion. 7: An Efficient LR Parser Generator for Tree-Adjoining Grammars, C.A. Prolo Introduction TAGS On Some Degenerate LR Models for TAGS Proposed Algorithm Implementation Example Some Properties Of the Algorithms Evaluation Conclusions. 8: Relating Tabular Parsing Algorithms for LIG and TAG, M.A. Alonso, E. de la Clergerie, V.J. Diaz, M. Vilares Introduction Tree-Adjoining Grammars Linear Indexed Grammars Bottom-up Parsing Algorithms Barley-like Parsing Algorithms Barley-like Parsing Algorithms Preserving the Correct Prefix Property Bidirectional Parsing Specialized TAG parsers Conclusion. 9: Improved Left-Corner Chart Parsing for Large Context-Free Grammars, R.C. Moore Introduction Evaluating Parsing Algorithms Terminology and Notation Test Grammars Left-Corner Parsing Algorithms and Refinements Grammar Transformations Extracting Parses from the Chart Comparison to Other Algorithms Conclusions. 10: On Two Classes of Feature Paths in Large-Scale Unification Grammars, L. Ciortuz Introduction Compiling the Quick Check Filter Generalised Rule Reduction Conclusion. 11: A Context-Free Superset Approximation of Unification-Based Grammars, B. Kiefer, H.-U. Krieger Introduction Basic Inventory Approximation as Fixpoint Construction The Basic Algorithm Implementation Issues and Optimizations Revisiting the Fixpoint Construction Three Grammars Disambiguation of UBGs via Probabilistic Approximations. 12: A Recognizer for Minimalist Languages, H. Harkema Introduction Minimalist Grammars Specification of the Recognizer Correctness Complexity Results Conclusions and Future Work. 13: Range Concatenation Grammars, P. Boullier Introduction Positive Range Concatenation Grammars Negative Range Concatenation Grammars A Parsing Algorithm for RCGs Closure Properties and Modularity Conclusion. 14: Grammar Induction by MDL-Based Distributional Classification, Yikun Guo, Fuliang Weng, Lide Wu Introduction Grammar Induction with the MDL Principle Induction Strategies MDL Induction by Dynamic Distributional Classification (DCC) Comparison and Conclusion. Appendix. 15: Optimal Ambiguity Packing in Context-Free Parsers with Interleaved Unification, A. Lavie, C. Penstein Rose Introduction Ambiguity Packing in Context Free Parsing The Rule Prioritization Heuristic Empirical Evaluations and Discussion Conclusions and Future Directions. 16: Robust Data-Oriented Spoken Language Understanding, K. Sima'an Introduction Brief Overview of OVIS OP vs. Tree-Gram Application to the OVIS Domain Conclusions. 17: SOUP: A Parser for Real-World Spontaneous Speech, M. Gavalda Introduction Grammar Representation Sketch of the Parsing Algorithm Performance Key Features Conclusion. 18: Parsing and Hypergraphs, D. Klein, C.D. Manning Introduction Hypergraphs and Parsing Viterbi Parsing Algorithm Analysis Conclusion. Appendix. 19: Measure for Measure: Towards Increased Component Comparability and Exchange, S. Oepen, U. Callmeier Competence & Performance Profiling Strong Empiricism: A Few Examples PET - Synthesizing Current Best Practice Quantifying Progress Multi-Dimensional Performance Profiling Conclusion - Recent Developments. Index.