| Preface | |
| Developments in Parsing Technology: From Theory to Application | |
| Introduction | |
| About this book | |
| Parameter Estimation for Statistical Parsing Models: Theory and Practice of Distribution-Free Methods | |
| 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 | |
| High Precision Extraction of Grammatical Relations | |
| Introduction | |
| The Analysis System | |
| Empirical Results | |
| Conclusions and Further Work | |
| Automated Extraction of TAGs from the Penn Treebank | |
| Introduction | |
| Tree Extraction Procedure | |
| Evaluation | |
| Extended Extracted Grammars | |
| Related Work | |
| Conclusions | |
| Computing the Most Probable Parse for a Discontinuous Phrase-Structure Grammar | |
| Introduction | |
| Discontinuous Phrase-Structure Grammar | |
| The Parsing Algorithm | |
| Computing the Most Probable Parse | |
| Experiments | |
| Conclusion and Future Work | |
| A Neural Network Parser that Handles Sparse Data | |
| Introduction | |
| Simple Synchrony Networks | |
| A Probabilistic Parser for SSNs | |
| Estimating the Probabilities with a Simple Synchrony Network | |
| Generalizing from Sparse Data | |
| Conclusion | |
| An Efficient LR Parser Generator for Tree-Adjoining Grammars | |
| Introduction | |
| TAGS | |
| On Some Degenerate LR Models for TAGS | |
| Proposed Algorithm | |
| Implementation | |
| Example | |
| Some Properties Of the Algorithms | |
| Evaluation | |
| Conclusions | |
| Relating Tabular Parsing Algorithms for LIG and TAG | |
| 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 | |
| Improved Left-Corner Chart Parsing for Large Context-Free Grammars | |
| 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 | |
| On Two Classes of Feature Paths in Large-Scale Unification Grammars | |
| Introduction | |
| Compiling the Quick Check Filter | |
| Generalised Rule Reduction | |
| Conclusion | |
| A Context-Free Superset Approximation of Unification-Based Grammars | |
| 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 | |
| A Recognizer for Minimalist Languages | |
| Introduction | |
| Minimalist Grammars | |
| Specification of the Recognizer | |
| Correctness | |
| Complexity Results | |
| Conclusions and Future Work | |
| Range Concatenation Grammars | |
| Introduction | |
| Positive Range Concatenation Grammars | |
| Negative Range Concatenation Grammars | |
| A Parsing Algorithm for RCGs | |
| Closure Properties and Modularity | |
| Conclusion | |
| Grammar Induction by MDL-Based Distributional Classification | |
| Introduction | |
| Grammar Induction with the MDL Principle | |
| Induction Strategies | |
| MDL Induction by Dynamic Distributional Classification (DCC) | |
| Comparison and Conclusion | |
| Appendix | |
| Optimal Ambiguity Packing in Context-Free Parsers with Interleaved Unification | |
| Introduction | |
| Ambiguity Packing in Context Free Parsing | |
| The Rule Prioritization Heuristic | |
| Empirical Evaluations and Discu | |
| Table of Contents provided by Publisher. All Rights Reserved. |
