Zusammenfassung
This article presents an HPSG parser using a technique called CFG filtering. The parser predicts possible parse trees using a CFG generated automatically from a given HPSG-based grammar. Parsing costs are reduced because unification is applied only to the predicted parse trees. In other words, parsing is speeded up because the parser avoids unnecessary unification by eliminating impossible parse trees. We show the method for generating a CFG from an HPSG-based grammar and outline a parsing scheme using the CFG. The effectiveness of the parsing scheme is shown through experimental results obtained by using several HPSG-based grammars, including the LinGO grammar.
Nutzer