TDL : a type description language for HPSG. - Part 1: Overview

Abstract

Unification-based grammar formalisms have become the predominant paradigm in natural language processing NLP and computational linguistics CL. Their success stems from the fact that they can be seen as high-level declarative programming languages for linguists, which allow them to express linguistic knowledge in a monotonic fashion. More over, such formalisms can be given a precise set theoretical semantics. This paper presents mathcal{TDL}, a typed featurebased language and inference system, which is specically designed to support highly lexicalized grammar theories like HPSG, FUG, or CUG. mathcal{TDL} allows the user to define possibly recursive hierarchically ordered types consisting of type constraints and feature constraints over the boolean connectives wedge, vee, and neg. mathcal{TDL} distinguishes between avm types (open-world reasoning), sort types (closed-world reasoning), built-in types and atoms, and allows the declaration of partitions and incompatible types. Working with partially as well as with fully expanded types is possible, both at definition time and at run time. mathcal{TDL} is incremental, i.e., it allows the redefinition of types and the use of undefined types. Efficient reasoning is accomplished through four specialized reasoners