## New Developments in Parsing TechnologyH. Bunt, John Carroll, Giorgio Satta Parsing can be defined as the decomposition of complex structures into their constituent parts, and parsing technology as the methods, the tools, and the software to parse automatically. Parsing is a central area of research in the automatic processing of human language. Parsers are being used in many application areas, for example question answering, extraction of information from text, speech recognition and understanding, and machine translation. New developments in parsing technology are thus widely applicable. This book contains contributions from many of today's leading researchers in the area of natural language parsing technology. The contributors describe their most recent work and a diverse range of techniques and results. This collection provides an excellent picture of the current state of affairs in this area. This volume is the third in a series of such collections, and its breadth of coverage should make it suitable both as an overview of the current state of the field for graduate students, and as a reference for established researchers. |

### What people are saying - Write a review

### Contents

2 | 19 |

3 | 57 |

4 | 73 |

vi | 80 |

5 | 90 |

6 | 107 |

An Efficient LR Parser Generator for TreeAdjoining Grammars | 125 |

18 | 140 |

Three Grammars | 241 |

Disambiguation of UBGs via Probabilistic Approximations | 247 |

12 | 248 |

A Recognizer for Minimalist Languages | 251 |

Minimalist Grammars | 252 |

Specification of the Recognizer | 256 |

viii | 260 |

13 | 267 |

Relating Tabular Parsing Algorithms for LIG and | 157 |

Earleylike Parsing Algorithms | 166 |

Earleylike Parsing Algorithms Preserving the Correct Prefix Prop erty | 171 |

Bidirectional Parsing | 178 |

Specialized TAG parsers | 180 |

Conclusion | 182 |

Miguel A Alonso Eric de la Clergerie Vıctor J Dıaz and Manuel Vilares | 185 |

Evaluating Parsing Algorithms | 186 |

Terminology and Notation | 187 |

LeftCorner Parsing Algorithms and Refinements | 188 |

Grammar Transformations | 193 |

Extracting Parses from the Chart | 196 |

Comparison to Other Algorithms | 197 |

Conclusions | 199 |

On Two Classes of Feature Paths in LargeScale Unification Grammars 203 | 202 |

Compiling the Quick Check Filter | 205 |

3 | 212 |

Generalised Rule Reduction | 215 |

Conclusion | 224 |

A ContextFree Superset Approximation of UnificationBased Grammars | 229 |

Basic Inventory | 231 |

Approximation as Fixpoint Construction | 232 |

The Basic Algorithm | 233 |

Implementation Issues and Optimizations | 235 |

Revisiting the Fixpoint Construction | 240 |

14 | 291 |

15 | 307 |

16 | 322 |

17 | 339 |

Grammar Representation | 340 |

Sketch of the Parsing Algorithm | 341 |

Performance | 343 |

Key Features | 345 |

Conclusion | 349 |

Parsing and Hypergraphs | 351 |

Dan Klein and Christopher D Manning 1 Introduction 2 Hypergraphs and Parsing 3 Viterbi Parsing Algorithm | 359 |

Analysis | 363 |

Conclusion | 368 |

Appendix | 369 |

Towards Increased Component Comparability and Exchange | 373 |

Stephan Oepen and Ulrich Callmeier 1 2 3 4 5 6 Index Competence Performance Profiling | 375 |

A Few Examples | 378 |

PET Synthesizing Current Best Practice | 384 |

Quantifying Progress | 385 |

MultiDimensional Performance Profiling | 387 |

Conclusion Recent Developments | 391 |

397 | |

399 | |

400 | |