{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,8]],"date-time":"2025-10-08T15:42:08Z","timestamp":1759938128898,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":26,"publisher":"ACM","license":[{"start":{"date-parts":[[2020,7,25]],"date-time":"2020-07-25T00:00:00Z","timestamp":1595635200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"name":"Australian Research Council","award":["DP170102231"],"award-info":[{"award-number":["DP170102231"]}]},{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["IIS-1815528"],"award-info":[{"award-number":["IIS-1815528"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2020,7,25]]},"DOI":"10.1145\/3397271.3401263","type":"proceedings-article","created":{"date-parts":[[2020,7,25]],"date-time":"2020-07-25T07:50:08Z","timestamp":1595663408000},"page":"1821-1824","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":16,"title":["Efficiency Implications of Term Weighting for Passage Retrieval"],"prefix":"10.1145","author":[{"given":"Joel","family":"Mackenzie","sequence":"first","affiliation":[{"name":"University of Melbourne, Melbourne, Australia"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Zhuyun","family":"Dai","sequence":"additional","affiliation":[{"name":"Carnegie Mellon University, Pittsburgh, PA, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Luke","family":"Gallagher","sequence":"additional","affiliation":[{"name":"RMIT University, Melbourne, Australia"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jamie","family":"Callan","sequence":"additional","affiliation":[{"name":"Carnegie Mellon University, Pittsburgh, PA, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2020,7,25]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/1658377.1658378"},{"volume-title":"Proc. CIKM. 426--434","author":"Broder A. Z.","key":"e_1_3_2_1_2_1","unstructured":"A. Z. Broder , D. Carmel , M. Herscovici , A. Soffer , and J. Zien . 2003. Efficient Query Evaluation Using a Two-level Retrieval Process . In Proc. CIKM. 426--434 . A. Z. Broder, D. Carmel, M. Herscovici, A. Soffer, and J. Zien. 2003. Efficient Query Evaluation Using a Two-level Retrieval Process. In Proc. CIKM. 426--434."},{"volume-title":"Proc. SIGIR. 43--50","author":"Carmel D.","key":"e_1_3_2_1_3_1","unstructured":"D. Carmel , D. Cohen , R. Fagin , E. Farchi , M. Herscovici , Y. S. Maarek , and A. Soffer . 2001. Static Index Pruning for Information Retrieval Systems . In Proc. SIGIR. 43--50 . D. Carmel, D. Cohen, R. Fagin, E. Farchi, M. Herscovici, Y. S. Maarek, and A. Soffer. 2001. Static Index Pruning for Information Retrieval Systems. In Proc. SIGIR. 43--50."},{"volume-title":"Proc. WSDM. 201--210","author":"Crane M.","key":"e_1_3_2_1_4_1","unstructured":"M. Crane , J. S. Culpepper , J. Lin , J. Mackenzie , and A. Trotman . 2017. A Comparison of Document-at-a-Time and Score-at-a-Time Query Evaluation . In Proc. WSDM. 201--210 . M. Crane, J. S. Culpepper, J. Lin, J. Mackenzie, and A. Trotman. 2017. A Comparison of Document-at-a-Time and Score-at-a-Time Query Evaluation. In Proc. WSDM. 201--210."},{"key":"e_1_3_2_1_5_1","unstructured":"Z. Dai and J. Callan. 2019. Context-Aware Sentence\/Passage Term Importance Estimation for First Stage Retrieval. arXiv preprint arXiv:1910.10687 (2019).  Z. Dai and J. Callan. 2019. Context-Aware Sentence\/Passage Term Importance Estimation for First Stage Retrieval. arXiv preprint arXiv:1910.10687 (2019)."},{"volume-title":"Proc. WWW. 1897--1907","author":"Dai Z.","key":"e_1_3_2_1_6_1","unstructured":"Z. Dai . and J. Callan . 2020. Context-Aware Document Term Weighting for Ad-Hoc Search . In Proc. WWW. 1897--1907 . Z. Dai. and J. Callan. 2020. Context-Aware Document Term Weighting for Ad-Hoc Search. In Proc. WWW. 1897--1907."},{"volume-title":"Proc. NAACL-HLT. 4171--4186","author":"Devlin J.","key":"e_1_3_2_1_7_1","unstructured":"J. Devlin , M-W. Chang , K. Lee , and K. Toutanova . 2019. BERT: Pre-training of Deep Bidirectional Transformers for Language Understanding . In Proc. NAACL-HLT. 4171--4186 . J. Devlin, M-W. Chang, K. Lee, and K. Toutanova. 2019. BERT: Pre-training of Deep Bidirectional Transformers for Language Understanding. In Proc. NAACL-HLT. 4171--4186."},{"volume-title":"Proc. SIGIR. 993--1002","author":"Ding S.","key":"e_1_3_2_1_8_1","unstructured":"S. Ding and T. Suel . 2011. Faster top-k document retrieval using block-max indexes . In Proc. SIGIR. 993--1002 . S. Ding and T. Suel. 2011. Faster top-k document retrieval using block-max indexes. In Proc. SIGIR. 993--1002."},{"volume-title":"Proc. IEEE BigData. 686--695","author":"Jiang W.","key":"e_1_3_2_1_9_1","unstructured":"W. Jiang , J. Rodriguez , and T. Suel . 2017. Improved methods for static index pruning . In Proc. IEEE BigData. 686--695 . W. Jiang, J. Rodriguez, and T. Suel. 2017. Improved methods for static index pruning. In Proc. IEEE BigData. 686--695."},{"volume-title":"Proc. ECIR. 28--34","author":"Kamphuis C.","key":"e_1_3_2_1_10_1","unstructured":"C. Kamphuis , A. de Vries , L. Boytsov , and J. Lin . 2020. Which BM25 Do You Mean? A Large-Scale Reproducibility Study of Scoring Variants . In Proc. ECIR. 28--34 . C. Kamphuis, A. de Vries, L. Boytsov, and J. Lin. 2020. Which BM25 Do You Mean? A Large-Scale Reproducibility Study of Scoring Variants. In Proc. ECIR. 28--34."},{"volume-title":"Proc. ECIR. 145--158","author":"Kim Y.","key":"e_1_3_2_1_11_1","unstructured":"Y. Kim , J. Callan , J. S. Culpepper , and A. Moffat . 2016. Does Selective Search Benefit from WAND Optimization? . In Proc. ECIR. 145--158 . Y. Kim, J. Callan, J. S. Culpepper, and A. Moffat. 2016. Does Selective Search Benefit from WAND Optimization?. In Proc. ECIR. 145--158."},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1002\/spe.2203"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/3397271.3401404"},{"volume-title":"Proc. SIGIR. 625--634","author":"Mallia A.","key":"e_1_3_2_1_14_1","unstructured":"A. Mallia , G. Ottaviano , E. Porciani , N. Tonellotto , and R. Venturini . 2017. Faster BlockMax WAND with Variable-sized Blocks . In Proc. SIGIR. 625--634 . A. Mallia, G. Ottaviano, E. Porciani, N. Tonellotto, and R. Venturini. 2017. Faster BlockMax WAND with Variable-sized Blocks. In Proc. SIGIR. 625--634."},{"volume-title":"2019 b","author":"Mallia A.","key":"e_1_3_2_1_15_1","unstructured":"A. Mallia , M. Siedlaczek , J. Mackenzie , and T. Suel . 2019 b . PISA : Performant Indexes and Search for Academia . In Proc. of the Open-Source IR Replicability Challenge (OSIRRC) at SIGIR 2019. 50--56. A. Mallia, M. Siedlaczek, J. Mackenzie, and T. Suel. 2019 b. PISA: Performant Indexes and Search for Academia. In Proc. of the Open-Source IR Replicability Challenge (OSIRRC) at SIGIR 2019. 50--56."},{"volume-title":"Proc. ECIR. 353--368","author":"Mallia A.","key":"e_1_3_2_1_16_1","unstructured":"A. Mallia , M. Siedlaczek , and T. Suel . 2019 a. An Experimental Study of Index Compression and DAAT Query Processing Methods . In Proc. ECIR. 353--368 . A. Mallia, M. Siedlaczek, and T. Suel. 2019 a. An Experimental Study of Index Compression and DAAT Query Processing Methods. In Proc. ECIR. 353--368."},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1023\/A:1013002601898"},{"volume-title":"Proc. NeurIPS Workshop on Cognitive Computation. 96--105","author":"Nguyen T.","key":"e_1_3_2_1_18_1","unstructured":"T. Nguyen , M. Rosenberg , X. Song , J. Gao , S. Tiwary , R. Majumder , and L. Deng . 2016. MS MARCO: A Human Generated MAchine Reading COmprehension Dataset . In Proc. NeurIPS Workshop on Cognitive Computation. 96--105 . T. Nguyen, M. Rosenberg, X. Song, J. Gao, S. Tiwary, R. Majumder, and L. Deng. 2016. MS MARCO: A Human Generated MAchine Reading COmprehension Dataset. In Proc. NeurIPS Workshop on Cognitive Computation. 96--105."},{"key":"e_1_3_2_1_19_1","unstructured":"R. Nogueira and J. Lin. 2019. From doc2query to docTTTTTquery. Online preprint (2019).  R. Nogueira and J. Lin. 2019. From doc2query to docTTTTTquery. Online preprint (2019)."},{"key":"e_1_3_2_1_20_1","unstructured":"R. Nogueira W. Yang J. Lin and K. Cho. 2019. Document Expansion by Query Prediction. arXiv preprint arXiv:1904.08375 (2019).  R. Nogueira W. Yang J. Lin and K. Cho. 2019. Document Expansion by Query Prediction. arXiv preprint arXiv:1904.08375 (2019)."},{"volume-title":"Proc. NAACL-HLT. 2227--2237","author":"Peters M.","key":"e_1_3_2_1_21_1","unstructured":"M. Peters , M. Neumann , M. Iyyer , M. Gardner , C. Clark , K. Lee , and L. Zettlemoyer . 2018. Deep Contextualized Word Representations . In Proc. NAACL-HLT. 2227--2237 . M. Peters, M. Neumann, M. Iyyer, M. Gardner, C. Clark, K. Lee, and L. Zettlemoyer. 2018. Deep Contextualized Word Representations. In Proc. NAACL-HLT. 2227--2237."},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1561\/1500000057"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1016\/0306-4573(95)00020-H"},{"volume-title":"Proc. SIGIR. 105--114","author":"Wang L.","key":"e_1_3_2_1_24_1","unstructured":"L. Wang , J. Lin , and D. Metzler . 2011. A Cascade Ranking Model for Efficient Ranked Retrieval . In Proc. SIGIR. 105--114 . L. Wang, J. Lin, and D. Metzler. 2011. A Cascade Ranking Model for Efficient Ranked Retrieval. In Proc. SIGIR. 105--114."},{"key":"e_1_3_2_1_25_1","first-page":"16","article-title":"Anserini: Reproducible Ranking Baselines Using Lucene","volume":"10","author":"Yang P.","year":"2018","unstructured":"P. Yang , H. Fang , and J. Lin . 2018 . Anserini: Reproducible Ranking Baselines Using Lucene . J. Data Inf. Qual. , Vol. 10 , 4 (2018), 16 .1--16.20. P. Yang, H. Fang, and J. Lin. 2018. Anserini: Reproducible Ranking Baselines Using Lucene. J. Data Inf. Qual., Vol. 10, 4 (2018), 16.1--16.20.","journal-title":"J. Data Inf. Qual."},{"key":"e_1_3_2_1_26_1","volume-title":"Neural Ranking: Learning a Sparse Representation for Inverted Indexing. In Proc. CIKM. 497--506.","author":"Zamani H.","year":"2018","unstructured":"H. Zamani , M. Dehghani , W. B. Croft , E. Learned-Miller , and J. Kamps . 2018 . From Neural Re-Ranking to Neural Ranking: Learning a Sparse Representation for Inverted Indexing. In Proc. CIKM. 497--506. H. Zamani, M. Dehghani, W. B. Croft, E. Learned-Miller, and J. Kamps. 2018. From Neural Re-Ranking to Neural Ranking: Learning a Sparse Representation for Inverted Indexing. In Proc. CIKM. 497--506."}],"event":{"name":"SIGIR '20: The 43rd International ACM SIGIR conference on research and development in Information Retrieval","sponsor":["SIGIR ACM Special Interest Group on Information Retrieval"],"location":"Virtual Event China","acronym":"SIGIR '20"},"container-title":["Proceedings of the 43rd International ACM SIGIR Conference on Research and Development in Information Retrieval"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3397271.3401263","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3397271.3401263","content-type":"application\/pdf","content-version":"vor","intended-application":"syndication"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3397271.3401263","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T22:41:38Z","timestamp":1750200098000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3397271.3401263"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,7,25]]},"references-count":26,"alternative-id":["10.1145\/3397271.3401263","10.1145\/3397271"],"URL":"https:\/\/doi.org\/10.1145\/3397271.3401263","relation":{},"subject":[],"published":{"date-parts":[[2020,7,25]]},"assertion":[{"value":"2020-07-25","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}