Sciweavers

ACL
2000

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

14 years 7 days ago
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.
Marcel P. van Lohuizen
Added 01 Nov 2010
Updated 01 Nov 2010
Type Conference
Year 2000
Where ACL
Authors Marcel P. van Lohuizen
Comments (0)