Memory-efficient and thread-safe quasi-destructive graph unification

Authors:
Marcel P. van Lohuizen
Affiliations:
Delft University of Technology
Venue:
ACL '00 Proceedings of the 38th Annual Meeting on Association for Computational Linguistics
Year:
2000

Citing 6
Cited 1

New Classes for Parallel Complexity: A Study of Unification and Other Complete Problems for P

IEEE Transactions on Computers
Cache miss equations: an analytical representation of cache misses

ICS '97 Proceedings of the 11th international conference on Supercomputing
Efficient feature structure operations without compilation

Natural Language Engineering
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
Quasi-destructive graph unification with structure-sharing

COLING '92 Proceedings of the 14th conference on Computational linguistics - Volume 2

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

Quantified Score

Hi-index	0.00

Visualization

Abstract

In terms of both speed and memory consumption, graph unification remains the most expensive component of unification-based grammar parsing. We present a technique to reduce the memory usage of unification algorithms considerably, without increasing execution times. Also, the proposed algorithm is thread-safe, providing an efficient algorithm for parallel processing as well.