Efficient transformation-based parsing

Authors:
Giorgio Satta;Eric Brill
Affiliations:
Università di Padova, Padova, Italy;Johns Hopkins University, Baltimore, MD
Venue:
ACL '96 Proceedings of the 34th annual meeting on Association for Computational Linguistics
Year:
1996

Citing 11
Cited 3

Introduction to algorithms

Introduction to algorithms
Rewrite systems

Handbook of theoretical computer science (vol. B)
Faster tree pattern matching

Journal of the ACM (JACM)
Regular models of phonological rule systems

Computational Linguistics - Special issue on computational phonology
Deterministic part-of-speech tagging with finite-state transducers

Computational Linguistics
Transformation-based error-driven learning and natural language processing: a case study in part-of-speech tagging

Computational Linguistics
Pattern Matching in Trees

Journal of the ACM (JACM)
Efficient string matching: an aid to bibliographic search

Communications of the ACM
Term Rewriting Systems with Priorities

RTA '87 Proceedings of the 2nd International Conference on Rewriting Techniques and Applications
Automatic grammar induction and parsing free text: a transformation-based approach

ACL '93 Proceedings of the 31st annual meeting on Association for Computational Linguistics
A rule-based approach to prepositional phrase attachment disambiguation

COLING '94 Proceedings of the 15th conference on Computational linguistics - Volume 2

Randomized rule selection in transformation-based learning: a comparative study

Natural Language Engineering
A trainable rule-based algorithm for word segmentation

ACL '98 Proceedings of the 35th Annual Meeting of the Association for Computational Linguistics and Eighth Conference of the European Chapter of the Association for Computational Linguistics
Constrained atomic term: widening the reach of rule templates in transformation based learning

EPIA'05 Proceedings of the 12th Portuguese conference on Progress in Artificial Intelligence

Quantified Score

Hi-index	0.00

Visualization

Abstract

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 inefficient. We exploit this sparseness in rule applications to derive an algorithm two to three orders of magnitude faster than the standard parsing algorithm.