The logic of typed feature structures
The logic of typed feature structures
A Framework for Inductive Learning of Typed-Unification Grammars
ICGI '02 Proceedings of the 6th International Colloquium on Grammatical Inference: Algorithms and Applications
LIGHT - A Constraint Language and Compiler System for Typed-Unification Grammars
KI '02 Proceedings of the 25th Annual German Conference on AI: Advances in Artificial Intelligence
The interface between phrasal and functional constraints
Computational Linguistics
Efficient feature structure operations without compilation
Natural Language Engineering
The LiLFeS Abstract Machine and its evaluation with the LinGO grammar
Natural Language Engineering
Parser engineering and performance profiling
Natural Language Engineering
A compact architecture for dialogue management based on scripts and meta-outputs
ANLC '00 Proceedings of the sixth conference on Applied natural language processing
HPSG-style underspecified Japanese grammar with wide coverage
COLING '98 Proceedings of the 17th international conference on Computational linguistics - Volume 2
A structure-sharing representation for unification-based grammar formalisms
ACL '85 Proceedings of the 23rd annual meeting on Association for Computational Linguistics
Using restriction to extend parsing algorithms for complex-feature-based formalisms
ACL '85 Proceedings of the 23rd annual meeting on Association for Computational Linguistics
Categorial unification grammars
COLING '86 Proceedings of the 11th coference on Computational linguistics
COLING '92 Proceedings of the 14th conference on Computational linguistics - Volume 1
Quasi-destructive graph unification with structure-sharing
COLING '92 Proceedings of the 14th conference on Computational linguistics - Volume 2
A bag of useful techniques for efficient and robust parsing
ACL '99 Proceedings of the 37th annual meeting of the Association for Computational Linguistics on Computational Linguistics
An indexing scheme for typed feature structures
COLING '02 Proceedings of the 19th international conference on Computational linguistics - Volume 2
Learning attribute values in typed-unification grammars: on generalised rule reduction
COLING-02 proceedings of the 6th conference on Natural language learning - Volume 20
| Hi-index | 0.00 |
We investigate two related techniques, Quick Check and Generalised Reduction, that contribute significantly to speeding up parsing with large-scale typed-unification grammars. The techniques take advantage of the properties of two particular classes of feature paths. Quick check is concerned with paths that most often lead to unification failure, whereas generalised reduction takes advantage of paths that do not (or only seldom) contribute to unification failure. Both sets of paths are obtained empirically by parsing a training corpus. We experiment with the two techniques, using a compilation-based parsing system on a large-scale grammar of English. The combined improvement in parsing speed we obtained is 56%.