Relaxing Underspecified Semantic Representations for Reinterpretation - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 1999

Relaxing Underspecified Semantic Representations for Reinterpretation


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.
Fichier principal
Vignette du fichier
relax2000.pdf (489.45 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

inria-00536811 , version 1 (16-11-2010)


  • HAL Id : inria-00536811 , version 1


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. ⟨inria-00536811⟩
48 View
18 Download


Gmail Facebook Twitter LinkedIn More