@techreport{R-91-35,
TITLE = {Unifying Disjunctive Feature Structures},
AUTHOR = {Lena Str{\"o}mb{\"a}ck},
YEAR = {1991},
NUMBER = {R-91-35},
INSTITUTION = ida,
ADDRESS = idaaddr,
ABSTRACTURL = {/publications/cgi-bin/tr-fetch.pl?r-91-35+abstr},
ABSTRACT = {This paper describes an algorithm for unifying disjunctive feature structures. Unlike previous algorithms, except Eisele & D{\"o}rre (1990), this algorithm is as fast as an algorithm without disjunction when disjunctions do not participate in the unification, it is also as fast as an algorithm handling only local disjunctions when there are only local disjunctions, and expensive only in the case of unifying full disjunction. The description is given in the framework of graph unification algorithms which makes it easy to implement as an extension of such an algorithm. },
IDANR = {LiTH-IDA-R-91-35}