Paper: Achieving Flexibility In Unification Formalisms

ACL ID C94-2135
Title Achieving Flexibility In Unification Formalisms
Venue International Conference on Computational Linguistics
Session Main Conference
Year 1994

We argue that flexibility is an important property for unification-based formalisms. By flexibility we mean the ability for the user to modify and extend the for- malism according to the needs of his problem. The paper discusses some properties necessary to achieve a flexible formalism and presents the FLUF formal- ism as a realization of these ideas. 1 MOTIVATION Unification based-formalisms are in common use within natural language processing and many differ- ent formalisms have been defined. PATR-II (Shieber et al. , 1983) is the most basic and a kind of common denominator which other formalisms are extensions of. Other formalisms are STUF (Beierle et al. , 1988), TFS (Emele & Zajac, 1990), CUF (D6rre & Eisele, 1991) and, ALE (Carpenter, 1992). These formalisms include, for example, dis...