Paper: Efficient Transformation-Based Parsing

ACL ID P96-1034
Title Efficient Transformation-Based Parsing
Venue Annual Meeting of the Association of Computational Linguistics
Session Main Conference
Year 1996

In transformation-based parsing, a finite sequence of tree rewriting rules are checked for application to an input structure. Since in practice only a small percentage of rules are applied to any particular structure, the naive parsing algorithm is rather ineffi- cient. We exploit this sparseness in rule applications to derive an algorithm two to three orders of magnitude faster than the standard parsing algorithm.