Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

11

ACL
1996

favoriteEmaildiscussreport

103views Computational Linguistics» more ACL 1996»

Efficient Transformation-Based Parsing

13 years 5 months ago

Efficient Transformation-Based Parsing

Download www.aclweb.org

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.

Giorgio Satta, Eric Brill

Real-time Traffic

ACL 1996 | ACL 2007 | Naive Parsing Algorithm | Parsing Algorithm | Tree Rewriting Rules |

claim paper

Related Content

» Automatic Grammar Induction and Parsing Free Text A TransformationBased Approach

» Adaptive TransformationBased Learning for Improving Dictionary Tagging

» Efficient parsing strategies for syntactic analysis of closed captions

» An Efficient Syntactic Analyzer Using Semantic Connection Units

» Efficient Parsing for French

» Efficient probabilistic topdown and leftcorner parsing

» Efficiently building a parse tree from a regular expression

» Ambiguity resolution in a reductionistic parser

» Tabulation of Automata for TreeAdjoining Languages

Post Info
More Details (n/a)

Added	02 Nov 2010
Updated	02 Nov 2010
Type	Conference
Year	1996
Where	ACL
Authors	Giorgio Satta, Eric Brill

Comments (0)