Skip to Main content Skip to Navigation
Conference papers

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.
Complete list of metadata

https://hal.inria.fr/inria-00536811
Contributor : Joachim Niehren Connect in order to contact the contributor
Submitted on : Tuesday, November 16, 2010 - 11:09:44 PM
Last modification on : Tuesday, October 31, 2017 - 2:22:18 PM
Long-term archiving on: : Thursday, February 17, 2011 - 3:15:22 AM

Files

relax2000.pdf
Files produced by the author(s)

Identifiers

  • 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. ⟨inria-00536811⟩

Share

Metrics

Record views

43

Files downloads

18