Relaxing Underspecified Semantic Representations for Reinterpretation

Abstract : Type and sort conflicts in semantics are usually resolved by a process of reinterpretation. Recently, Egg (1999) has proposed an alternative account in which conflicts are avoided by underspecification. The main idea is to derive sufficiently relaxed underspecified semantic representations; addition of reinterpretation operators then simply is further specialization. But in principle, relaxing underspecified representations bears the danger of overgeneration. In this paper, we investigate this problem in the framework of CLLS, where underspecified representations are expressed by tree descriptions subsuming dominance constraints. We introduce some novel properties of dominance constraints and present a safety criterion that ensures that an underspecified description can be relaxed without adding unwanted readings. We then apply this criterion systematically to Egg's analysis and show why its relaxation operation does not lead to overgeneration.
Type de document :
Communication dans un congrès
6th Meeting on Mathematics of Language, 1999, Orlando, Florida, United States. pp.74--87, 1999
Liste complète des métadonnées

https://hal.inria.fr/inria-00536811
Contributeur : Joachim Niehren <>
Soumis le : mardi 16 novembre 2010 - 23:09:44
Dernière modification le : mardi 31 octobre 2017 - 14:22:18
Document(s) archivé(s) le : jeudi 17 février 2011 - 03:15:22

Fichiers

relax2000.pdf
Fichiers produits par l'(les) auteur(s)

Identifiants

  • HAL Id : inria-00536811, version 1

Citation

Alexander Koller, Joachim Niehren, Kristina Striegnitz. Relaxing Underspecified Semantic Representations for Reinterpretation. 6th Meeting on Mathematics of Language, 1999, Orlando, Florida, United States. pp.74--87, 1999. 〈inria-00536811〉

Partager

Métriques

Consultations de la notice

72

Téléchargements de fichiers

32