Paper: Structure Sharing Problem And Its Solution In Graph Unification

ACL ID C94-2143
Title Structure Sharing Problem And Its Solution In Graph Unification
Venue International Conference on Computational Linguistics
Session Main Conference
Year 1994
Authors

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-structure sharing in inputs oc- curs only when feature-structure sharing occurs.