Effective Parsing Using Competing CFG Rules

Hits: 5512
Research areas: Year: 2011
Type of Publication: In Proceedings Keywords: parsing, syntactic analysis, CFG, competing rule
Editor: Ivan Habernal, Václav Matoušek Volume: 6836/2011
Book title: Proceedings of the 14th international conference on Text, Speech and Dialogue (TSD2011)
Series: Lecture Notes in Computer Science Pages: 115-122
Address: Plzeň, Czech Republic
Organization: TSD2011 Month: September 1-5
ISBN: 9783642235375
In this paper a new pruning method for a rule-based parser is described that relies on separating the underlying grammar rules into several mutually competing levels. This method has been developed and exploited for Czech in the syntactic parser Synt to reduce the number of possible output derivation trees. The algorithm behind operates on a so called packed forest of trees, a compressing data structure used for internal representation of parallel analyses, and thus performs very effectively. An evaluation of its contribution has been performed on the Brno Phrasal Treebank showing that the algorithm significantly prunes the resulting tree space while preserving perspective parses.