Efficient Transformation-Based Parsing

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.

• Type: Conference
• Year: 1996
• Where: ACL
• Authors: Giorgio Satta, Eric Brill
• Keywords: ACL 1996, ACL 2007, Naive Parsing Algorithm, Parsing Algorithm, Tree Rewriting Rules