Structure Sharing Problem And Its Solution In Graph Unification

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 occurs only when feature-structure sharing occurs.

• Type: Conference
• Year: 1994
• Where: COLING
• Authors: Kiyoshi Kogure
• Keywords: COLING 1994, COLING 2008, Data-structure Sharing, Feature-structure Sharing, Graph Unification Algorithms