@techreport{R-94-12,
PSURL = {/publications/cgi-bin/tr-fetch.pl?r-94-12+ps},
ABSTRACTURL = {/publications/cgi-bin/tr-fetch.pl?r-94-12+abstr},
ABSTRACT = {FLUF: A FLexible Unification Formalism 
- the Idea
Lena Strömbäck
Abstract
In this report we focus on flexibility as an important property for a unification-based formalism within natural language processing. We motivate the need for a flexible formalism by observing that the extensions defined for unification-based formalism are numerous. Moreover, it does not seem possible to define a formalism which include all these extensions and variants of extensions why we instead suggest a flexible formalism which can be adjusted to the needs of the user as the solution.
We present the main features of FLUF as our solution to a flexible formalism. We also demonstrate how FLUF can be used by expressing some different extensions proposed for unification-based formalisms in it and by comparing it to some other unification-based formalisms.
},
TITLE = {FLUF: A Flexible Unification Formalism - the Idea. The short version accepted to the 15th International Conference on Computational Linguistics, Kyoto, Japan, 5-9 Augusti 1994},
AUTHOR = {Lena Str{\"o}mb{\"a}ck},
EMAIL = {lestr@ida.liu.se},
YEAR = {1994},
NUMBER = {R-94-12},
INSTITUTION = ida,
ADDRESS = idaaddr,
IDANR = {LiTH-IDA-R-94-12}