IMS Stuttgart

Welcome to the CUF Web Page

CUF - Comprehensive Unification Formalism

This site collects some documentation of the Comprehensive Unification Formalism CUF, a unification-based grammar formalism. CUF has been developed approximately between 1989 and 1996. The work was supported by the ESPRIT projects DYANA and DYANA-2 (coordinated by ILLC, University of Amsterdam) and the project B5 in the Sonderforschungsbereich 340 (SFB 340) at the Institut für Maschinelle Sprachverarbeitung, Universität Stuttgart.

• CUF Implementation

  Since the CUF system is no longer supported, the (source) code is only available on demand. Please write to kcl@ims.uni-stuttgart.de.

• Description of the CUF Formalism

  CUF - A Formalism for Linguistic Knowledge Representation
  by Jochen Dörre and Michael Dorna
  DYANA 2 deliverable R.1.2A, August 1993
  PostScript, 22 pages

• The CUF User's Manual

  The CUF User's Manual
  by Jochen Dörre, Michael Dorna, Jörg Junger and Katrin Schneider
  Institut für Maschinelle Sprachverarbeitung, Stuttgart, Edition 2.0, November 1996
  PostScript, 47 pages / HTML
  (These documents were converted from a single Texinfo source using texi2www.)

• A CUF Tutorial

  A CUF Tutorial
  by Esther König
  Institut für Maschinelle Sprachverarbeitung, Stuttgart, May 1998
  ( Latex source .tar.gz, .ps.gz/26pp./90K)

• Some applications of CUF
  • DYANA-2 prototype (semantic processing)
  • LexGram (a lexical grammar formalism based on CUF)
  • SFB 340/B9 (semantic processing)
  • Verbmobil
  CUF has inspired the design of the TIGERSearch corpus query language.