TDL : a type description language for HPSG. - Part 1: Overview
Hans‐Ulrich Krieger, Ulrich Schäfer · 1994
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. Moreover, such formalisms can be given a precise, set-theoretical semantics. This paper presents TDL, a typed feature-based language and inference system, which is specifically designed to support highly lexicalized grammar theories like HPSG, FUG, or CUG. TDL allows the user to define (possibly recursive) hierarchically-ordered types, consisting of type constraints and feature constraints over the boolean connectives , , and :. 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 ...