A Notion of Semantic Coherence for Underspecified Semantic Representation
Open Access
- 1 March 2018
- journal article
- research article
- Published by MIT Press in Computational Linguistics
- Vol. 44 (1) , 39-83
Abstract
The general problem of finding satisfying solutions to constraint-based underspecified representations of quantifier scope is NP-complete. Existing frameworks, including Dominance Graphs, Minimal Recursion Semantics, and Hole Semantics, have struggled to balance expressivity and tractability in order to cover real natural language sentences with efficient algorithms. We address this trade-off with a general principle of coherence, which requires that every variable introduced in the domain of discourse must contribute to the overall semantics of the sentence. We show that every underspecified representation meeting this criterion can be efficiently processed, and that our set of representations subsumes all previously identified tractable sets.Keywords
This publication has 12 references indexed in Scilit:
- An Efficient Enumeration Algorithm for Canonical Form Underspecified Semantic Representations2011
- Quantifier scope disambiguation using extracted pragmatic knowledge2009
- Scope and Situation Binding in LTAG Using Semantic UnificationResearch on Language and Computation, 2008
- Minimal Recursion Semantics: An IntroductionResearch on Language and Computation, 2005
- An efficient graph algorithm for dominance constraintsJournal of Algorithms, 2003
- A Machine Learning Approach to Modeling Scope PreferencesComputational Linguistics, 2003
- Bridging the gap between underspecification formalisms2003
- Bridging the gap between underspecification formalisms2003
- An algebra for semantic construction in constraint-based grammars2001
- Monotonic semantic interpretation1992