| C92-1059 | have been developed using graph | unification techniques | . Unification programs based |
| C92-1059 | has been implemented using graph | unification techniques | . A term structure is represented |
| H89-1047 | grammar extends commonly-used | unification techniques | for parsing and representing |
| N13-1103 | of the example based semantic | unification techniques | . It replaces DFA-EQUAL with |
| C92-1059 | have been developed usiug graph | unification techniques | \ -LSB- 23 , 16 \ -RSB- . Programs |
| C96-1048 | - work . Using also the simple | unification technique | a resolution of the pronoun can |
| N13-1103 | importance of our DFA based semantic | unification technique | . Specifi - cally , our model |
| N13-1103 | is in contrast to the syntactic | unification technique | , used by Kwiatkowski et al. |
| C96-1048 | anaphoric pronoun . Using the simple | unification technique | , as for the processing of other |
| J90-4011 | head-centered rules and a unique | unification technique | that preserves both space and |
| C90-3013 | sense toy ones written to test | unification techniques | but are the tools of a major |
