Paper: Memory-Efficient And Thread-Safe Quasi-Destructive Graph Unification

ACL ID P00-1045
Title Memory-Efficient And Thread-Safe Quasi-Destructive Graph Unification
Venue Annual Meeting of the Association of Computational Linguistics
Session Main Conference
Year 2000
Authors

In terms of both speed and mem- ory consumption, graph uni cation remains the most expensive com- ponent of uni cation-based gram- mar parsing. We present a tech- nique to reduce the memory usage of uni cation algorithms consider- ably, without increasing execution times. Also, the proposed algorithm is thread-safe, providing an e cient algorithm for parallel processing as well.