The logic of typed feature structures
The logic of typed feature structures
The Design and Analysis of Computer Algorithms
The Design and Analysis of Computer Algorithms
Default representation in constraint-based frameworks
Computational Linguistics
The ACQUILEX LKB: representation issues in semi-automatic acquisition of large lexicons
ANLC '92 Proceedings of the third conference on Applied natural language processing
A structure-sharing representation for unification-based grammar formalisms
ACL '85 Proceedings of the 23rd annual meeting on Association for Computational Linguistics
Quasi-destructive graph unification
ACL '91 Proceedings of the 29th annual meeting on Association for Computational Linguistics
Unification with lazy non-redundant copying
ACL '91 Proceedings of the 29th annual meeting on Association for Computational Linguistics
Quasi-destructive graph unification with structure-sharing
COLING '92 Proceedings of the 14th conference on Computational linguistics - Volume 2
Strategic lazy incremental copy graph unification
COLING '90 Proceedings of the 13th 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
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
AVM description compilation using types as modes
EACL '03 Proceedings of the tenth conference on European chapter of the Association for Computational Linguistics - Volume 1
An indexing scheme for typed feature structures
COLING '02 Proceedings of the 19th international conference on Computational linguistics - Volume 2
Tractability and structural closures in attribute logic type signatures
ACL '01 Proceedings of the 39th Annual Meeting on Association for Computational Linguistics
A generic approach to parallel chart parsing with an application to LinGO
ACL '01 Proceedings of the 39th Annual Meeting on Association for Computational Linguistics
Indexing methods for efficient parsing
NAACLstudent '03 Proceedings of the 2003 Conference of the North American Chapter of the Association for Computational Linguistics on Human Language Technology: Proceedings of the HLT-NAACL 2003 student research workshop - Volume 3
A tabulation-based parsing method that reduces copying
ACL '03 Proceedings of the 41st Annual Meeting on Association for Computational Linguistics - Volume 1
Memory-efficient and thread-safe quasi-destructive graph unification
ACL '00 Proceedings of the 38th Annual Meeting on Association for Computational Linguistics
Learning attribute values in typed-unification grammars: on generalised rule reduction
COLING-02 proceedings of the 6th conference on Natural language learning - Volume 20
On two classes of feature paths in large-scale unification grammars
New developments in parsing technology
Measure for measure: towards increased component comparability and exchange
New developments in parsing technology
Optimizing typed feature structure grammar parsing through non-statistical indexing
ACL '04 Proceedings of the 42nd Annual Meeting on Association for Computational Linguistics
From ubgs to cfgs a practical corpus-driven approach
Natural Language Engineering
Extremely lexicalized models for accurate and fast HPSG parsing
EMNLP '06 Proceedings of the 2006 Conference on Empirical Methods in Natural Language Processing
A log-linear model with an n-gram reference distribution for accurate HPSG parsing
IWPT '07 Proceedings of the 10th International Conference on Parsing Technologies
High precision analysis of NPs with a deep processing grammar
STEP '08 Proceedings of the 2008 Conference on Semantics in Text Processing
Parsing '05 Proceedings of the Ninth International Workshop on Parsing Technology
| Hi-index | 0.00 |
One major obstacle to the efficient processing of large wide coverage grammars in unification-based grammatical frameworks such as HPSG is the time and space cost of the unification operation itself. In a grammar development system it is not appropriate to address this problem with techniques which involve lengthy compilation, since this slows down the edit-test-debug cycle. Nor is it possible to radically restructure the grammar. In this paper, we describe novel extensions to an existing efficient unification algorithm which improve its space and time behaviour (without affecting its correctness) by substantially increasing the amount of structure sharing that takes place. We also describe a fast and automatically tunable pre-unification filter (the ‘quick check’) which in practice detects a large proportion of unifications that if performed would fail. Finally, we present an efficient algorithm for checking for subsumption relationships between two feature structures; a special case of this gives a fast equality test. The subsumption check is used in a parser (described elsewhere in this issue) which ‘packs’ local ambiguities to avoid performing redundant sub-computations.