3 search results - page 1 / 1 » Quasi-Destructive Graph Unification with Structure-Sharing |
COLING
1992
13 years 6 months ago
1992
ACL
2000
13 years 6 months 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
13 years 6 months 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...