Dale Gerdemann
ABSTRACT
In this paper, we argue that type inferencing incorrectly implements appropriateness specifications for typed feature structures, promote a combination of type resolution and unfilling as a correct and efficient alternative, and consider the expressive limits of this alternative approach. Throughout, we use feature cooccurence restrictions as illustration and linguistic motivation.
- Hasam Ait-Kaci. A New Model of Computation Based on a Calculus of Type Subsumption. Ph.D thesis, University of Pennsylvania, 1985.Google Scholar
- Bob Carpenter. the Logic of Typed Feature Structures. Cambridge Tracts in Theoretical Computer Science 32. Cambridge University Press, 1992. Google ScholarDigital Library
- Bob Carpenter. ALE The Attribute Logic Engine, User's Guide, 1993.Google Scholar
- Ann Copestake, Antonio Sanfilippo, Ted Briscoe, and Valeria De Paiva. The ACQUILEX LKB: An introduction. In Ted Briscoe, Valeria De Paiva, and Ann Copestake, editors, Inheritance, Defaults, and the Lexicon, pages 148--163. Cambridge UP, 1993. Google Scholar
- Jochen DÖrre and Andreas Eisele. Feature logic with disjunctive unification. In COLING-90 vol. 2, pages 100--105, 1990. Google Scholar
- Gerald Gazdar, Ewan Klein, Geoffrey Pullum, and Ivan Sag. Generalized Phrase Structure Grammar. Harvard University Press, Cambridge, Mass, 1985.Google Scholar
- Dale Gerdemann. Parsing and Generation of Unification Grammars. PhD thesis, University of Illinois, 1991. Published as Beckman Institute Cognitive Science Technical Report CS-91-06. Google ScholarDigital Library
- Dale Gerdemann. Troll: Type resolution system, user's guide, 1994. Manual for the Troll system implemented by Dale Gerdemann & Thilo Göötz.Google Scholar
- Dale Gerdemann and Paul John King. Typed feature structures for expressing and computationally implementing feature cooccurence restrictions. In Procceedings of 4. Fachtagung der Sektion Computer-linguistik der Deutschen Gesellschaft für Sprachwissenschaft, pages 33--39, 1993.Google Scholar
- Thilo Götz. A normal form for typed feature structures. Master's thesis, Universität Tübingen, 1993.Google Scholar
- John Griflith. Disjunction and Efficient Processing of Feature Descriptions. PhD thesis, Universität Tübingen, 1994. Tentative Title.Google Scholar
- Paul John King. Typed feature structures as descriptions, 1994. In these proceedings. Google ScholarDigital Library
- John T. Maxwell III and Ronald M Kaplan. An overview of disjunctive constraint satisfaction. In Proccedings of International Workshop on Parsing Technologies, pages 18--27, 1989.Google Scholar
- Carl Pollard and Ivan Sag. Head Driven Phrase Structure Grammar. CSLI Lecture Notes. Chicago University Press, Chicago, forthcoming.Google Scholar
Recommendations
Appendix: Definitions of typed feature structures
The LinGO grammar consists of a specification of a type system and of various typed feature structures which are well-formed according to the type system. The typed feature structures function as grammar rules, lexical rules and lexical entries. There ...
A note on typing feature structures
Feature structures are used to convey linguistic information in a variety of linguistic formalisms. Various definitions of feature structures exist; one dimension of variation is typing: unlike untyped feature structures, typed ones associate a type ...
Dependently typed programming in Agda
TLDI '09: Proceedings of the 4th international workshop on Types in language design and implementationDependently typed languages have for a long time been used to describe proofs about programs. Traditionally, dependent types are used mostly for stating and proving the properties of the programs and not in defining the programs themselves. An ...
Comments