{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,9,14]],"date-time":"2023-09-14T15:30:49Z","timestamp":1694705449385},"reference-count":23,"publisher":"MIT Press - Journals","issue":"1","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Computational Linguistics"],"published-print":{"date-parts":[[2018,3]]},"abstract":"<jats:p> 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. <\/jats:p>","DOI":"10.1162\/coli_a_00307","type":"journal-article","created":{"date-parts":[[2017,12,14]],"date-time":"2017-12-14T20:23:10Z","timestamp":1513282990000},"page":"39-83","source":"Crossref","is-referenced-by-count":1,"title":["A Notion of Semantic Coherence for Underspecified Semantic Representation"],"prefix":"10.1162","volume":"44","author":[{"given":"Mehdi","family":"Manshadi","sequence":"first","affiliation":[{"name":"University of Rochester"}]},{"given":"Daniel","family":"Gildea","sequence":"additional","affiliation":[{"name":"University of Rochester"}]},{"given":"James F.","family":"Allen","sequence":"additional","affiliation":[{"name":"University of Rochester"}]}],"member":"281","reference":[{"key":"bib2","doi-asserted-by":"crossref","unstructured":"Alshawi, Hiyan and Richard Crouch. 1992. Monotonic semantic interpretation. In Proceedings of the 30th Annual Conference of the Association for Computational Linguistics (ACL-92), pages 32\u201339, Newark, DE.","DOI":"10.3115\/981967.981972"},{"key":"bib3","doi-asserted-by":"publisher","DOI":"10.1016\/S0196-6774(03)00050-6"},{"key":"bib4","unstructured":"Bodirsky, Manuel, Denys Duchier, Joachim Niehren, and Sebastian Miele. 2004. A new algorithm for normal dominance constraints. In ACM-SIAM Symposium on Discrete Algorithms, pages 59\u201367, Vancouver."},{"key":"bib5","unstructured":"Bos, Johan. 1996. Predicate logic unplugged. In Proceedings of the 10th Amsterdam Colloquium, pages 133\u2013143, Amsterdam."},{"key":"bib7","unstructured":"Copestake, Ann and Dan Flickinger. 2000. An open source grammar development environment and broad-coverage English grammar using HPSG. In Proceedings of Language Resources and Evaluation Conference (LREC-2000), pages 591\u2013600, Athens."},{"key":"bib8","doi-asserted-by":"publisher","DOI":"10.1007\/s11168-006-6327-9"},{"key":"bib9","doi-asserted-by":"crossref","unstructured":"Copestake, Ann, Alex Lascarides, and Dan Flickinger. 2001. An algebra for semantic construction in constraint-based grammars. In Proceedings of the 39th Annual Conference of the Association for Computational Linguistics (ACL-01), pages 140\u2013147, Toulouse.","DOI":"10.3115\/1073012.1073031"},{"key":"bib10","unstructured":"Frege, Gottlob. 1923. \u201cgedankengef\u00fcge\u201d [\u201ccompound thought\u201d]. Beitr\u00e4ge zur Philosophie des Deutschen Idealismus, III:36\u201351."},{"key":"bib11","doi-asserted-by":"crossref","unstructured":"Fuchss, Ruth, Alexander Koller, Joachim Niehren, and Stefan Thater. 2004. Minimal recursion semantics as dominance constraints: Translation, evaluation, and analysis. In Proceedings of the 42nd Annual Conference of the Association for Computational Linguistics (ACL-04), pages 247\u2013254, Barcelona.","DOI":"10.3115\/1218955.1218987"},{"key":"bib12","doi-asserted-by":"publisher","DOI":"10.1162\/089120103321337449"},{"key":"bib13","unstructured":"Hobbs, Jerry R. and Stuart M. Shieber. 1987. An algorithm for generating quantifier scopings. Computational Linguistics, 13(1-2):47\u201363."},{"key":"bib14","doi-asserted-by":"publisher","DOI":"10.1007\/s11168-008-9046-6"},{"key":"bib16","doi-asserted-by":"crossref","unstructured":"Koller, Alexander, Joachim Niehren, and Stefan Thater. 2003. Bridging the gap between underspecification formalisms: Hole semantics as dominance constraints. In 10th Conference of the European Chapter of the Association for Computational Linguistics (EACL-03), pages 195\u2013202, Budapest.","DOI":"10.3115\/1067807.1067834"},{"key":"bib17","unstructured":"Koller, Alexander and Stefan Thater. 2007. Solving unrestricted dominance graphs. In Proceedings of the 12th Conference on Formal Grammar, pages 1\u201312, Dublin."},{"key":"bib18","unstructured":"Manshadi, Mehdi and James Allen. 2012. Expanding the range of tractable scope-underspecified semantic representations. In *SEM 2012: The First Joint Conference on Lexical and Computational Semantics, pages 142\u2013150, Montr\u00e9al."},{"key":"bib19","unstructured":"Manshadi, Mehdi, James Allen, and Mary Swift. 2008a. Towards a universal underspecified semantic representation. In Proceedings of the 13th International Conference on Formal Grammar, Hamburg."},{"key":"bib20","unstructured":"Manshadi, Mehdi, Daniel Gildea, and James F. Allen. 2013. Plurality, negation, and quantification: Towards comprehensive quantifier scope disambiguation. In Proceedings of the 51st Annual Meeting of the Association for Computational Linguistics (ACL-13), pages 64\u201372, Sofia."},{"key":"bib21","unstructured":"Manshadi, Mehdi H., James F. Allen, and Mary Swift. 2008b. Toward a universal underspecified semantic representation. In Proceedings of the 13th Conference on Formal Grammar (FG), pages 77\u201394, Hamburg."},{"key":"bib22","doi-asserted-by":"crossref","unstructured":"Manshadi, Mehdi H., James F. Allen, and Mary Swift. 2009. An efficient enumeration algorithm for canonical form underspecified semantic representations. In Proceedings of the 14th Conference on Formal Grammar (FG), pages 85\u2013101, Bordeaux.","DOI":"10.1007\/978-3-642-20169-1_6"},{"key":"bib23","doi-asserted-by":"crossref","unstructured":"Niehren, Joachim and Stefan Thater. 2003. Bridging the gap between underspecification formalisms: Minimal recursion semantics as dominance constraints. In Proceedings of the 41th Annual Conference of the Association for Computational Linguistics (ACL-03), pages 367\u2013374, Sapporo.","DOI":"10.3115\/1075096.1075143"},{"key":"bib24","doi-asserted-by":"publisher","DOI":"10.1093\/jos\/10.2.123"},{"key":"bib25","unstructured":"Schubert, Lenhart K. and Francis Jeffry Pelletier. 1982. From English to logic: Context-free computation of \u201cconventional\u201d logical translation. Computational Linguistics, 8(1):26\u201344."},{"key":"bib26","doi-asserted-by":"crossref","unstructured":"Srinivasan, Prakash and Alexander Yates. 2009. Quantifier scope disambiguation using extracted pragmatic knowledge: Preliminary results. In Conference on Empirical Methods in Natural Language Processing (EMNLP-09), pages 1465\u20131474, Singapore.","DOI":"10.3115\/1699648.1699693"}],"container-title":["Computational Linguistics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.mitpressjournals.org\/doi\/pdf\/10.1162\/COLI_a_00307","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,3,12]],"date-time":"2021-03-12T21:28:11Z","timestamp":1615584491000},"score":1,"resource":{"primary":{"URL":"https:\/\/direct.mit.edu\/coli\/article\/44\/1\/39-83\/1592"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,3]]},"references-count":23,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2018,3]]}},"alternative-id":["10.1162\/COLI_a_00307"],"URL":"https:\/\/doi.org\/10.1162\/coli_a_00307","relation":{},"ISSN":["0891-2017","1530-9312"],"issn-type":[{"value":"0891-2017","type":"print"},{"value":"1530-9312","type":"electronic"}],"subject":[],"published":{"date-parts":[[2018,3]]}}}