Precompilation of HPSG in ALE into a CFG for fast parsing

Authors:
John C. Brown;Suresh Manandhar
Affiliations:
INVU Services Ltd., Blisworth Hill Farm, Blisworth, UK;University of York, York, UK
Venue:
Proceedings of the COLING-2000 Workshop on Efficiency In Large-Scale Parsing Systems
Year:
2000

Citing 3
Cited 0

Compilation versus abstract machines for fast parsist of typed feature structure grammars

Future Generation Computer Systems
An HPSG parser with CFG filtering

Natural Language Engineering
Using restriction to extend parsing algorithms for complex-feature-based formalisms

ACL '85 Proceedings of the 23rd annual meeting on Association for Computational Linguistics

Quantified Score

Hi-index	0.00

Visualization

Abstract

Context free grammars parse faster than TFS grammars, but have disadvantages. On our test TFS grammar, precompilation into CFG results in a speedup of 16 times for parsing without taking into account additional mechanisms for increasing parsing efficiency. A formal overview is given of precompilation and parsing. Modifications to ALE rules permit a closure over the rules from the lexicon, and analysis leading to a fast treatment of semantic structure. The closure algorithm, and retrieval of full semantic structure are described.