| C96-2111 | use of the linking relation with | destructive unification | in parsing requires special com |
| E89-1026 | does not allow this so-called | destructive unification | and therefore unification is |
| E89-1026 | reformulated . The necessity for | destructive unification | becomes clear from ( 9 ) , where |
| P99-1061 | While an improvement over simple | destructive unification | , Tomabechi 's approach still |
| P91-1041 | trivial addition to the original | destructive unification | algorithm ( Pereira 's and Wroblewski |
| C96-2111 | structures and used in parsing with | destructive unification | leads to the top-down instantiation |
| W14-4335 | content with the context through | destructive unification | ( Ehlen and Johnston , 2012 ) |
| P91-1042 | need to be copied first before a | destructive unification | operation can be applied to combine |
| P99-1061 | structures before performing a | destructive unification | operation , while the other is |
| C94-2143 | the lnerged graph , Since the | destructive unification | process modifies its input graphs |
