Feature logic for dotted types: a formalism for complex word meanings

Authors:
Manfred Pinkal;Michael Kohlhase
Affiliations:
Universität des Saarlandes, Germany;Universität des Saarlandes, Germany
Venue:
ACL '00 Proceedings of the 38th Annual Meeting on Association for Computational Linguistics
Year:
2000

Citing 3
Cited 1

The generative lexicon

Computational Linguistics
A polymorphic record calculus and its compilation

ACM Transactions on Programming Languages and Systems (TOPLAS)
Ontological domains, semantic sorts and systematic ambiguity

International Journal of Human-Computer Studies - Special issue: the role of formal ontology in the information technology

Towards a Type-Theoretical Account of Lexical Semantics

Journal of Logic, Language and Information

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper we revisit Pustejovsky's proposal to treat ontologically complex word meaning by so-called dotted pairs. We use a higher-order feature logic based on Ohori's record λ-calculus to model the semantics of words like book and library, in particular their behavior in the context of quantification and cardinality statements.