C92-3164 definitions is examined using the unification algorithm . Finally , a set of phrase definitions
C92-3164 the generation system is also a unification algorithm . However , unlike the analysis
C88-1043 version of the well known term unification algorithm . The objects to be unified are
C92-4185 given below correspond to the unification algorithm for formulas not containing disjunction
C88-2113 algorithms are similar to graph unification algorithms . Specifically , the parallel
C92-4185 nine corresponds to a case in the unification algorithm . The only difference is that
C92-1020 essentially the one produced by an unification algorithm for feature structures . Given
C94-2135 flexible formalism rather than unification algorithms there , will be no further discussion
C92-4185 1-9 above with an ordinary graph unification algorithm . Doing this we can conclude
C90-3013 therefore important to develop unification algorithms that can in practice unify disjunctive
C92-1059 this paper 's formalization . Unification algorithms for augmented terms or augmented
A00-2022 machinery to the quasi-destructive unification algorithm described by Tomabechi ( 1991
C92-1030 Tile active chart parser and the unification algorithm are implemented in C on Sun4
C88-1060 algorithm . However , traditional unification algorithms do not deal with disjnnetion
C92-4185 implement as an extensron of a graph unification algorithm . 2 The Formulas Feature structures
C92-3164 as the quasi-destructive graph unification algorithm \ -LSB- Tomabechi-91 \ -RSB-
C92-4185 relate and implement as a graph unification algorithm . This paper shows that it is
C92-2088 -LSB- 6 \ -RSB- ) to describe our unification algorithm of feature descriptions , except
C90-3013 Nadine formalism , Propane 's unification algorithm , like Kasper 's , is exponential
C92-2088 equivalence cases , we introduce a unification algorithm based on sets of compatible pairs
hide detail