{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,4]],"date-time":"2022-04-04T16:04:55Z","timestamp":1649088295362},"reference-count":26,"publisher":"Cambridge University Press (CUP)","issue":"4","license":[{"start":{"date-parts":[[2013,10,29]],"date-time":"2013-10-29T00:00:00Z","timestamp":1383004800000},"content-version":"unspecified","delay-in-days":0,"URL":"https:\/\/www.cambridge.org\/core\/terms"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Nat. Lang. Eng."],"published-print":{"date-parts":[[2014,10]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>Typically, automatic Question Answering (QA) approaches use the question in its entirety in the search for potential answers. We argue that decomposing complex factoid questions into separate facts about their answers is beneficial to QA, since an answer candidate with support coming from multiple independent facts is more likely to be the correct one. We broadly categorize decomposable questions as <jats:italic>parallel<\/jats:italic> or <jats:italic>nested<\/jats:italic>, and we present a novel question decomposition framework for enhancing the ability of single-shot QA systems to answer complex factoid questions. Essential to the framework are components for <jats:italic>decomposition recognition<\/jats:italic>, <jats:italic>question rewriting<\/jats:italic>, and <jats:italic>candidate answer synthesis and re-ranking<\/jats:italic>. We discuss the interplay among these, with particular emphasis on decomposition recognition, a process which, we argue, can be sufficiently informed by lexico-syntactic features alone. We validate our approach to decomposition by implementing the framework on top of IBM Watson\u2122, a state-of-the-art QA system, and showing a statistically significant improvement over its accuracy.<\/jats:p>","DOI":"10.1017\/s1351324913000326","type":"journal-article","created":{"date-parts":[[2013,10,29]],"date-time":"2013-10-29T10:17:52Z","timestamp":1383041872000},"page":"441-468","source":"Crossref","is-referenced-by-count":4,"title":["Parallel and nested decomposition for factoid questions"],"prefix":"10.1017","volume":"20","author":[{"given":"BRANIMIR","family":"BOGURAEV","sequence":"first","affiliation":[]},{"given":"SIDDHARTH","family":"PATWARDHAN","sequence":"additional","affiliation":[]},{"given":"ADITYA","family":"KALYANPUR","sequence":"additional","affiliation":[]},{"given":"JENNIFER","family":"CHU-CARROLL","sequence":"additional","affiliation":[]},{"given":"ADAM","family":"LALLY","sequence":"additional","affiliation":[]}],"member":"56","published-online":{"date-parts":[[2013,10,29]]},"reference":[{"key":"S1351324913000326_ref026","volume-title":"Data Mining \u2013 Practical Machine Learning Tools and Techniques with Java Implementations","author":"Witten","year":"2000"},{"key":"S1351324913000326_ref013","doi-asserted-by":"publisher","DOI":"10.1147\/JRD.2012.2184637"},{"key":"S1351324913000326_ref001","doi-asserted-by":"publisher","DOI":"10.1147\/JRD.2012.2188154"},{"key":"S1351324913000326_ref015","first-page":"118","volume-title":"Proceedings of the International Symposium on Natural Language and Logic","author":"McCord","year":"1989"},{"key":"S1351324913000326_ref022","first-page":"566","volume-title":"Proceedings of the 42nd Annual Meeting of the Association for Computational Linguistics","author":"Saquete","year":"2004"},{"key":"S1351324913000326_ref011","first-page":"1317","volume-title":"Proceedings of International Conference on Ontologies, Databases and Applications of Semantics","author":"Katz","year":"2002"},{"key":"S1351324913000326_ref020","doi-asserted-by":"publisher","DOI":"10.1147\/JRD.2012.2187392"},{"key":"S1351324913000326_ref006","first-page":"313","volume-title":"Proceedings of the 18th European Conference on Artificial Intelligence","author":"Hartrumpf","year":"2008"},{"key":"S1351324913000326_ref010","first-page":"35","volume-title":"Proceedings of the AAAI Workshop on Inference for Textual Question Answering","author":"Katz","year":"2005"},{"key":"S1351324913000326_ref021","first-page":"574","volume-title":"Proceedings of the 42nd Annual Meeting of the Association for Computational Linguistics","author":"Prager","year":"2004"},{"key":"S1351324913000326_ref014","first-page":"30","volume-title":"Proceedings of the SIGIR 2008 Workshop on Focused Retrieval","author":"Lin","year":"2008"},{"key":"S1351324913000326_ref025","doi-asserted-by":"publisher","DOI":"10.1147\/JRD.2012.2187239"},{"key":"S1351324913000326_ref018","doi-asserted-by":"publisher","DOI":"10.1147\/JRD.2012.2187249"},{"key":"S1351324913000326_ref023","first-page":"57","volume-title":"Proceedings of the Human Language Technology Conference of the North American Chapter of the Association for Computational Linguistics","author":"Soricut","year":"2004"},{"key":"S1351324913000326_ref009","doi-asserted-by":"publisher","DOI":"10.1147\/JRD.2012.2188934"},{"key":"S1351324913000326_ref019","doi-asserted-by":"publisher","DOI":"10.1147\/JRD.2012.2187036"},{"key":"S1351324913000326_ref007","doi-asserted-by":"publisher","DOI":"10.1147\/JRD.2012.2188737"},{"key":"S1351324913000326_ref024","first-page":"115","volume-title":"NIST Special Publication 500-251: The Eleventh Text Retrieval Conference (TREC 2002)","author":"Voorhees","year":"2002"},{"key":"S1351324913000326_ref002","doi-asserted-by":"publisher","DOI":"10.1147\/JRD.2012.2186682"},{"key":"S1351324913000326_ref003","doi-asserted-by":"publisher","DOI":"10.1147\/JRD.2012.2185901"},{"key":"S1351324913000326_ref004","doi-asserted-by":"publisher","DOI":"10.1609\/aimag.v31i3.2303"},{"key":"S1351324913000326_ref005","doi-asserted-by":"publisher","DOI":"10.1147\/JRD.2012.2188760"},{"key":"S1351324913000326_ref008","first-page":"2045","volume-title":"Proceedings of the 20th ACM International Conference on Information and Knowledge Management (CIKM '11)","author":"Kalyanpur","year":"2011"},{"key":"S1351324913000326_ref012","first-page":"1147","volume-title":"Proceedings of the Fifth Language Resources and Evaluation Conference","author":"Lacatusu","year":"2006"},{"key":"S1351324913000326_ref016","doi-asserted-by":"publisher","DOI":"10.1147\/JRD.2012.2185409"},{"key":"S1351324913000326_ref017","doi-asserted-by":"publisher","DOI":"10.1007\/BF02295996"}],"container-title":["Natural Language Engineering"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.cambridge.org\/core\/services\/aop-cambridge-core\/content\/view\/S1351324913000326","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,21]],"date-time":"2019-04-21T19:51:21Z","timestamp":1555876281000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.cambridge.org\/core\/product\/identifier\/S1351324913000326\/type\/journal_article"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,10,29]]},"references-count":26,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2014,10]]}},"alternative-id":["S1351324913000326"],"URL":"https:\/\/doi.org\/10.1017\/s1351324913000326","relation":{},"ISSN":["1351-3249","1469-8110"],"issn-type":[{"value":"1351-3249","type":"print"},{"value":"1469-8110","type":"electronic"}],"subject":[],"published":{"date-parts":[[2013,10,29]]}}}