Paper: Unifying Disjunctive Feature Structures

ACL ID C92-4185
Title Unifying Disjunctive Feature Structures
Venue International Conference on Computational Linguistics
Session Main Conference
Year 1992

This paper describes an algorithm for unifying dis- junctive feature structnres. Unlike previous algo- rithms, except Eisele & l)6n'e (1990), this algorithm is as fast as an algorithm withont disjunction when disjunctions do not participate in the unification, it is also as fast as an algorithm handling only local dis- junctions when there are only local disjunctions, and expensive only in tile case of unifying fnll disjunc- tion. The description is given in the fiamework of graph unification algoritbnls which ulakes it easy to implement as an extension of such an algorithm.