{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,8]],"date-time":"2025-10-08T15:42:41Z","timestamp":1759938161528,"version":"3.41.0"},"reference-count":49,"publisher":"Association for Computing Machinery (ACM)","issue":"2","license":[{"start":{"date-parts":[[2013,5,1]],"date-time":"2013-05-01T00:00:00Z","timestamp":1367366400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/100000145","name":"Division of Information and Intelligent Systems","doi-asserted-by":"publisher","id":[{"id":"10.13039\/100000145","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Center for Intelligent Information Retrieval"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["ACM Trans. Inf. Syst."],"published-print":{"date-parts":[[2013,5]]},"abstract":"<jats:p>Query reformulation modifies the original query with the aim of better matching the vocabulary of the relevant documents, and consequently improving ranking effectiveness. Previous models typically generate words and phrases related to the original query, but do not consider how these words and phrases would fit together in actual queries. In this article, a novel framework is proposed that models reformulation as a distribution of actual queries, where each query is a variation of the original query. This approach considers an actual query as the basic unit and thus captures important query-level dependencies between words and phrases. An implementation of this framework that only uses publicly available resources is proposed, which makes fair comparisons with other methods using TREC collections possible. Specifically, this implementation consists of a query generation step that analyzes the passages containing query words to generate reformulated queries and a probability estimation step that learns a distribution for reformulated queries by optimizing the retrieval performance. Experiments on TREC collections show that the proposed model can significantly outperform previous reformulation models.<\/jats:p>","DOI":"10.1145\/2457465.2457466","type":"journal-article","created":{"date-parts":[[2013,5,21]],"date-time":"2013-05-21T12:33:56Z","timestamp":1369139636000},"page":"1-34","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":17,"title":["Modeling reformulation using query distributions"],"prefix":"10.1145","volume":"31","author":[{"given":"Xiaobing","family":"Xue","sequence":"first","affiliation":[{"name":"University of Massachusetts, Amherst, MA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"W. Bruce","family":"Croft","sequence":"additional","affiliation":[{"name":"University of Massachusetts, Amherst, MA"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2013,5,17]]},"reference":[{"key":"e_1_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/1390334.1390419"},{"key":"e_1_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/1718487.1718492"},{"key":"e_1_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/1571941.1572140"},{"volume-title":"Proceedings of the Conference on Empirical Methods on Natural Language Processing and Computational Natural Language Learning (EMNLP-CoNLL'07)","author":"Bergsma S.","key":"e_1_2_1_4_1"},{"key":"e_1_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/1102351.1102363"},{"key":"e_1_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF01582063"},{"key":"e_1_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/1390334.1390377"},{"key":"e_1_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/1273496.1273513"},{"key":"e_1_2_1_9_1","unstructured":"Collins-Thompson K. 2008. Robust model estimation methods for information retrieval. Ph.D. thesis Carnegie Mellon University. Collins-Thompson K. 2008. Robust model estimation methods for information retrieval. Ph.D. thesis Carnegie Mellon University."},{"key":"e_1_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/1277741.1277795"},{"key":"e_1_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/133160.133180"},{"volume-title":"Proceedings of the 18th International Conference on String Processing and Information Retrieval. Springer, 380--385","author":"Cummins R.","key":"e_1_2_1_12_1"},{"key":"e_1_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/1718487.1718493"},{"key":"e_1_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.5555\/945365.964285"},{"key":"e_1_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/1390334.1390400"},{"key":"e_1_2_1_16_1","doi-asserted-by":"crossref","unstructured":"Herbrich R. Graepel T. and Obermayer K. 2000. Large Margin Rank Boundaries for Ordinal Regression. MIT Press Cambridge MA. Herbrich R. Graepel T. and Obermayer K. 2000. Large Margin Rank Boundaries for Ordinal Regression. MIT Press Cambridge MA.","DOI":"10.7551\/mitpress\/1113.003.0010"},{"key":"e_1_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1145\/1772690.1772737"},{"volume-title":"The SMART Retrieval System: Experiments in Automatic Document Processing","author":"Ide E.","key":"e_1_2_1_18_1"},{"key":"e_1_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1145\/860435.860538"},{"key":"e_1_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1145\/1135777.1135835"},{"key":"e_1_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1145\/383952.383970"},{"key":"e_1_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1145\/1871437.1871473"},{"key":"e_1_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1145\/383952.383972"},{"key":"e_1_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1145\/584792.584854"},{"key":"e_1_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1145\/1835449.1835546"},{"key":"e_1_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1145\/2009916.2009942"},{"key":"e_1_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.ipm.2004.05.001"},{"key":"e_1_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1145\/1076034.1076115"},{"key":"e_1_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1145\/1277741.1277796"},{"key":"e_1_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1145\/1277741.1277851"},{"key":"e_1_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1145\/290941.291008"},{"key":"e_1_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.1108\/eb046814"},{"key":"e_1_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.1145\/1367497.1367553"},{"key":"e_1_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.1145\/160688.160713"},{"volume-title":"The SMART Retrieval System: Experiments in Automatic Document Processing","author":"Rocchio J. J.","key":"e_1_2_1_35_1"},{"key":"e_1_2_1_36_1","doi-asserted-by":"publisher","DOI":"10.1145\/1935826.1935930"},{"key":"e_1_2_1_37_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-04417-5_8"},{"key":"e_1_2_1_38_1","doi-asserted-by":"publisher","DOI":"10.1145\/1835449.1835477"},{"key":"e_1_2_1_39_1","doi-asserted-by":"publisher","DOI":"10.1145\/1367497.1367545"},{"key":"e_1_2_1_40_1","doi-asserted-by":"publisher","DOI":"10.1145\/1835449.1835475"},{"key":"e_1_2_1_41_1","doi-asserted-by":"publisher","DOI":"10.1145\/1458082.1458147"},{"key":"e_1_2_1_42_1","doi-asserted-by":"publisher","DOI":"10.1145\/333135.333138"},{"key":"e_1_2_1_43_1","doi-asserted-by":"publisher","DOI":"10.1145\/1277741.1277809"},{"key":"e_1_2_1_44_1","doi-asserted-by":"publisher","DOI":"10.1145\/1571941.1571954"},{"volume-title":"Proceedings of the Annual International ACM SIGIR Conference on Research and Development in Information Retrieval (SIGIR'10)","author":"Xue X.","key":"e_1_2_1_45_1"},{"key":"e_1_2_1_46_1","doi-asserted-by":"publisher","DOI":"10.1145\/2009916.2010085"},{"key":"e_1_2_1_47_1","doi-asserted-by":"publisher","DOI":"10.1145\/1871437.1871656"},{"key":"e_1_2_1_48_1","doi-asserted-by":"publisher","DOI":"10.1145\/502585.502654"},{"key":"e_1_2_1_49_1","doi-asserted-by":"publisher","DOI":"10.1145\/383952.384019"}],"container-title":["ACM Transactions on Information Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2457465.2457466","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2457465.2457466","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T08:18:36Z","timestamp":1750234716000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2457465.2457466"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,5]]},"references-count":49,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2013,5]]}},"alternative-id":["10.1145\/2457465.2457466"],"URL":"https:\/\/doi.org\/10.1145\/2457465.2457466","relation":{},"ISSN":["1046-8188","1558-2868"],"issn-type":[{"type":"print","value":"1046-8188"},{"type":"electronic","value":"1558-2868"}],"subject":[],"published":{"date-parts":[[2013,5]]},"assertion":[{"value":"2011-11-01","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2012-11-01","order":1,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2013-05-17","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}