{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:31:12Z","timestamp":1750307472943,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":21,"publisher":"ACM","license":[{"start":{"date-parts":[[2010,7,19]],"date-time":"2010-07-19T00:00:00Z","timestamp":1279497600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2010,7,19]]},"DOI":"10.1145\/1835449.1835477","type":"proceedings-article","created":{"date-parts":[[2010,7,20]],"date-time":"2010-07-20T15:39:10Z","timestamp":1279640350000},"page":"154-161","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":27,"title":["How good is a span of terms?"],"prefix":"10.1145","author":[{"given":"Krysta M.","family":"Svore","sequence":"first","affiliation":[{"name":"Microsoft Research, Redmond, WA, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Pallika H.","family":"Kanani","sequence":"additional","affiliation":[{"name":"UMass, Amherst, Amherst, MA, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Nazan","family":"Khan","sequence":"additional","affiliation":[{"name":"Microsoft, Redmond, WA, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2010,7,19]]},"reference":[{"doi-asserted-by":"publisher","key":"e_1_3_2_1_1_1","DOI":"10.1145\/1066677.1066912"},{"key":"e_1_3_2_1_2_1","volume-title":"NIPS, page 193","author":"Burges C. J. C.","year":"2006","unstructured":"C. J. C. Burges , R. Ragno , and Q. V. Le . Learning to rank with nonsmooth cost functions . In NIPS, page 193 , 2006 . C. J. C. Burges, R. Ragno, and Q. V. Le. Learning to rank with nonsmooth cost functions. In NIPS, page 193, 2006."},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_3_1","DOI":"10.1145\/1148170.1148285"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_4_1","DOI":"10.1145\/1571941.1572021"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_5_1","DOI":"10.1145\/345508.345545"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_6_1","DOI":"10.1016\/S0306-4573(00)00015-7"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_7_1","DOI":"10.1145\/1571941.1571994"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_8_1","DOI":"10.1145\/1076034.1076115"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_9_1","DOI":"10.1007\/978-3-540-31865-1_36"},{"key":"e_1_3_2_1_10_1","volume-title":"Proceedings of RIAO-97","author":"Mitra M.","year":"1997","unstructured":"M. Mitra , C. Buckley , A. Singhal , and C. Cardie . An analysis of statistical and syntactic phrases . In Proceedings of RIAO-97 , 1997 . M. Mitra, C. Buckley, A. Singhal, and C. Cardie. An analysis of statistical and syntactic phrases. In Proceedings of RIAO-97, 1997."},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_11_1","DOI":"10.1145\/1277741.1277851"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_12_1","DOI":"10.5555\/1757788.1757808"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_13_1","DOI":"10.5555\/188490.188561"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_14_1","DOI":"10.1145\/1031171.1031181"},{"key":"e_1_3_2_1_15_1","volume-title":"M. Theobald, and G. Weikum. Efficient text proximity search. In SPIRE, page 287","author":"Schenkel R.","year":"2007","unstructured":"R. Schenkel , A. Broschart , S. won Hwang , M. Theobald, and G. Weikum. Efficient text proximity search. In SPIRE, page 287 , 2007 . R. Schenkel, A. Broschart, S. won Hwang, M. Theobald, and G. Weikum. Efficient text proximity search. In SPIRE, page 287, 2007."},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_16_1","DOI":"10.5555\/1793274.1793317"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_17_1","DOI":"10.1145\/1645953.1646237"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_18_1","DOI":"10.1145\/1277741.1277794"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_19_1","DOI":"10.1145\/1183614.1183698"},{"key":"e_1_3_2_1_20_1","volume-title":"NIPS Machine Learning for Web Search Workshop","author":"Yue Y.","year":"2007","unstructured":"Y. Yue and C. J. C. Burges . On using simultaneous perturbation stochastic approximation for IR measures, and the empirical optimality of LambdaRank . In NIPS Machine Learning for Web Search Workshop , 2007 . Y. Yue and C. J. C. Burges. On using simultaneous perturbation stochastic approximation for IR measures, and the empirical optimality of LambdaRank. In NIPS Machine Learning for Web Search Workshop, 2007."},{"key":"e_1_3_2_1_21_1","volume-title":"Proceedings of TREC 2004","author":"Zaragoza H.","year":"2004","unstructured":"H. Zaragoza , N. Craswell , M. Taylor , S. Saria , and S. Robertson . Microsoft cambridge at TREC 13: Web and hard tracks . In Proceedings of TREC 2004 , 2004 . H. Zaragoza, N. Craswell, M. Taylor, S. Saria, and S. Robertson. Microsoft cambridge at TREC 13: Web and hard tracks. In Proceedings of TREC 2004, 2004."}],"event":{"sponsor":["SIGIR ACM Special Interest Group on Information Retrieval"],"acronym":"SIGIR '10","name":"SIGIR '10: The 33rd International ACM SIGIR conference on research and development in Information Retrieval","location":"Geneva Switzerland"},"container-title":["Proceedings of the 33rd international ACM SIGIR conference on Research and development in information retrieval"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1835449.1835477","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1835449.1835477","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T12:08:46Z","timestamp":1750248526000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1835449.1835477"}},"subtitle":["exploiting proximity to improve web retrieval"],"short-title":[],"issued":{"date-parts":[[2010,7,19]]},"references-count":21,"alternative-id":["10.1145\/1835449.1835477","10.1145\/1835449"],"URL":"https:\/\/doi.org\/10.1145\/1835449.1835477","relation":{},"subject":[],"published":{"date-parts":[[2010,7,19]]},"assertion":[{"value":"2010-07-19","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}