@article{manshadi-etal-2018-notion,
title = "A Notion of Semantic Coherence for Underspecified Semantic Representation",
author = "Manshadi, Mehdi and
Gildea, Daniel and
Allen, James F.",
journal = "Computational Linguistics",
volume = "44",
number = "1",
month = apr,
year = "2018",
address = "Cambridge, MA",
publisher = "MIT Press",
url = "https://aclanthology.org/J18-1003",
doi = "10.1162/COLI_a_00307",
pages = "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.",
}
<?xml version="1.0" encoding="UTF-8"?>
<modsCollection xmlns="http://www.loc.gov/mods/v3">
<mods ID="manshadi-etal-2018-notion">
<titleInfo>
<title>A Notion of Semantic Coherence for Underspecified Semantic Representation</title>
</titleInfo>
<name type="personal">
<namePart type="given">Mehdi</namePart>
<namePart type="family">Manshadi</namePart>
<role>
<roleTerm authority="marcrelator" type="text">author</roleTerm>
</role>
</name>
<name type="personal">
<namePart type="given">Daniel</namePart>
<namePart type="family">Gildea</namePart>
<role>
<roleTerm authority="marcrelator" type="text">author</roleTerm>
</role>
</name>
<name type="personal">
<namePart type="given">James</namePart>
<namePart type="given">F</namePart>
<namePart type="family">Allen</namePart>
<role>
<roleTerm authority="marcrelator" type="text">author</roleTerm>
</role>
</name>
<originInfo>
<dateIssued>2018-04</dateIssued>
</originInfo>
<typeOfResource>text</typeOfResource>
<genre authority="bibutilsgt">journal article</genre>
<relatedItem type="host">
<titleInfo>
<title>Computational Linguistics</title>
</titleInfo>
<originInfo>
<issuance>continuing</issuance>
<publisher>MIT Press</publisher>
<place>
<placeTerm type="text">Cambridge, MA</placeTerm>
</place>
</originInfo>
<genre authority="marcgt">periodical</genre>
<genre authority="bibutilsgt">academic journal</genre>
</relatedItem>
<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.</abstract>
<identifier type="citekey">manshadi-etal-2018-notion</identifier>
<identifier type="doi">10.1162/COLI_a_00307</identifier>
<location>
<url>https://aclanthology.org/J18-1003</url>
</location>
<part>
<date>2018-04</date>
<detail type="volume"><number>44</number></detail>
<detail type="issue"><number>1</number></detail>
<extent unit="page">
<start>39</start>
<end>83</end>
</extent>
</part>
</mods>
</modsCollection>
%0 Journal Article
%T A Notion of Semantic Coherence for Underspecified Semantic Representation
%A Manshadi, Mehdi
%A Gildea, Daniel
%A Allen, James F.
%J Computational Linguistics
%D 2018
%8 April
%V 44
%N 1
%I MIT Press
%C Cambridge, MA
%F manshadi-etal-2018-notion
%X 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.
%R 10.1162/COLI_a_00307
%U https://aclanthology.org/J18-1003
%U https://doi.org/10.1162/COLI_a_00307
%P 39-83
Markdown (Informal)
[A Notion of Semantic Coherence for Underspecified Semantic Representation](https://aclanthology.org/J18-1003) (Manshadi et al., CL 2018)
ACL