Gerald Penn

A Quasi-Ring Construction for Compiling Attributed Type Signatures

Arbeitspapiere des SFB 340, Bericht Nr. 141 (1999), 19pp.
Postscript (214kb)1-up; Postscript gzip-komprimiert (77kb) 1-up , 2-up.


This paper identifies a misconception about the mathematical structure underlying subsumption matrices and their transitive closure, the fundamental compilation technique for efficient processing with partially ordered sets for the past ten years. It corrects it in a way that can be extended to the compilation of type hierarchies augmented with feature declarations and appropriateness conditions. These have been argued to be intended by linguists (King 1989), and to be valuable for processing efficiently with typed feature structures (Carpenter 1992; Carpenter and Penn 1996).

Seminar für Sprachwissenschaft
Eberhard-Karls-Universität Tübingen
Wilhelmstraße 113
72074 Tübingen