Memory-Efficient and Thread-Safe Quasi-Destructive Graph Unification

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.

• Type: Conference
• Year: 2000
• Where: ACL
• Authors: Marcel P. van Lohuizen
• Keywords: ACL 2000, ACL 2007, Algorithm, Graph Unification, Unification-based Grammar Parsing