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

Pinkal M, Kohlhase M (2000)

Publication Status: Published

Publication Type: Conference contribution

Publication year: 2000

Pages Range: 521-528

Conference Proceedings Title: Proceedings of the 38th Annual Meeting of the Association for Computational Linguistics

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 lambda-calculus to model the semantics of words like book and library, in particular their behavior in the context of quantification and cardinality statements.

Authors with CRIS profile

Michael Kohlhase Professur für Wissensrepräsentation und -verarbeitung

Involved external institutions

Universität des Saarlandes (UdS) DE Germany (DE)

How to cite

APA:

Pinkal, M., & Kohlhase, M. (2000). Feature logic for dotted types: A formalism for complex word meanings. In Proceedings of the 38th Annual Meeting of the Association for Computational Linguistics (pp. 521-528).

MLA:

Pinkal, Manfred, and Michael Kohlhase. "Feature logic for dotted types: A formalism for complex word meanings." Proceedings of the Proceedings of the 38th Annual Meeting of the Association for Computational Linguistics 2000. 521-528.

BibTeX: Download