| W06-3502 | unification algorithm similar to | quasi-destructive unification | , avoiding copying during unification |
| C94-2143 | unification , LING unification , and | quasi-destructive unification | have been developed . These algorithms |
| A00-2022 | employs similar machinery to the | quasi-destructive unification | algorithm described by Tomabechi |
| C94-2143 | strncture-sharillg version of | quasi-destructive unification | keeps update information in the |
| C94-2143 | obtained by this revision . Revised | Quasi-Destructive Unification | The strncture-sharillg version |
| C94-2143 | Tomabechi ( 1991 ) proposed a | quasi-destructive unification | that uses node structures with |
| W11-2923 | processing techniques such as | quasi-destructive unification | ( Tomabechi , 1991 ) , quick |
| C94-2143 | data-structure-sharing version of his | quasi-destructive unification | . 3.2 The Structure Sharing Problem |
| A00-2022 | single operation . But whereas | quasi-destructive unification | makes two passes ( determining |
