Proofs and types
The logic of typed feature structures
The logic of typed feature structures
Computational Linguistics
Enjoy the paper: lexical semantics via lexicology
COLING '90 Proceedings of the 13th conference on Computational linguistics - Volume 2
Towards a Type-Theoretical Account of Lexical Semantics
Journal of Logic, Language and Information
Hi-index | 0.00 |
Within the framework of Generative Lexicon theory (GL) we address some problems which subtype coercion poses for the type theory of classical formal semantics exemplified by pre-nominal genitive constructions and the coercion of sortal nouns into relational readings in such constructions. Relational interpretations of sortal nouns in genitive constructions depend on the ontological types of the referents of the two nominal expressions in these constructions and the way in which they interact. We propose to deal with ontological subtypes in the coercion of sortal nouns in terms of higher-order lambda calculus (∧-calculus), and we demonstrate how ∧-calculus operates on complex function types derived from an ontology of basic entity types.