A Case Study of Copredication over a Deverbal that Reconciles Empirical Data with Computational Semantics - LIRMM - Laboratoire d’Informatique, de Robotique et de Microélectronique de Montpellier
Conference Papers Year : 2015

A Case Study of Copredication over a Deverbal that Reconciles Empirical Data with Computational Semantics

Abstract

This paper is about the automated analysis of the lexical and compo-sitional semantics of nominalisation, in particular of felicitous co-predications — infelicitous ones are rejected. We focus on Brazilian Portuguese nominalisation introduced by the suffix-ura but our discussion applies to other nominalisations and languages as well. Much of the theoretical work on deverbals, including ours, concluded that deverbal senses (process, result, location and so on) are rather unforeseeable from the verb and the suffix. The (in)felicity of co-predication, that is the possible conjunction of two predicates which applies to different senses, is also difficult to predict, and in the case of deverbals it is assumed to be (almost) impossible. We present here a study of the CHAVE corpus and show that CHAVE does actually contain some of the supposedly non-existent copredica-tions. We explain our formalisation of sense variation and copredications in our logico-computational framework, Montagovean Generative Lexicon. We analyse the felicitous copredications and explain how the infelicitous ones are rejected. We give possible reasons for the felicity of the observed copredications, and finally we sketch out some guidelines for handling two notions that are necessary to a proper treatment of deverbals, namely local context and degree of semantic felicity.
Fichier principal
Vignette du fichier
LENLS12RealRetore54_66.pdf (1019.38 Ko) Télécharger le fichier
Origin Files produced by the author(s)
Loading...

Dates and versions

lirmm-01311129 , version 1 (03-05-2016)

Identifiers

  • HAL Id : lirmm-01311129 , version 1

Cite

Livy Real, Christian Retoré. A Case Study of Copredication over a Deverbal that Reconciles Empirical Data with Computational Semantics. LENLS: Logic and Engineering of Natural Language Semantics, Nov 2015, Tokyo, Japan. ⟨lirmm-01311129⟩
340 View
208 Download

Share

More