C92-3164 parsing method is consumed for the unification operation . In this system , besides dividing
C90-2035 requires augmenting the feature-based unification operation to richer , relational knowledge
C92-3164 basically accomplished using a unification operation between lexical items or successively
C92-1059 each x-class as in Figure 2 . The unification operation for such DGs corresponds to a
C92-1059 Augmented TFS Unification The unification operation for augmented 1 / , - terms or
C92-1009 the root node of PDI +1 . All unification operations are quasi-destructive , or temporal
C92-4185 in tile structures is that the unification operation becomes NP-complete . Therelore
C92-3164 rules and accomplished by the unification operation as described above . Generally
C92-1059 correspond to the generalization and unification operations on TFSs . A'it - Kaei defines
C90-2071 between alternative sequences of unification operations . A key feature of unification
C82-1019 of features is carried out as unification operations . Using the unification operation
A83-1010 Logic variables and provides a unification operation over them . The DCG formalism
C92-1059 object is merged by applying the unification operation to FSs . ILeseareh on unification-based
A83-1010 attempted unifications . If a unification operation on an arc fails , the arc is
C82-1019 presence of features before the unification operation is applied . This turned out
A83-1010 logical variables and including a unification operation on them . We will call such registers
A83-1010 which are subject to the standard unification operation . The final section concludes
C02-1100 unified . A credulous default unification operation is greedy in that it tries to
A83-1010 Logical Variables and provides a unification operation over them . We would like to
C92-1059 gorithms for generalization and unification operations as well as treat primitive negations
hide detail