3 search results - page 1 / 1 » Quasi-Destructive Graph Unification with Structure-Sharing |
COLING
1992
15 years 17 days ago
1992
ACL
2000
15 years 23 days ago
2000
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 me...
COLING
1994
15 years 22 days ago
1994
The revised graph unification algorithms presented here are more efficient because they reduce the amount of copying that was necessary because of the assumption that data-structu...