{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T04:24:15Z","timestamp":1750220655958,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":21,"publisher":"ACM","license":[{"start":{"date-parts":[[2020,10,19]],"date-time":"2020-10-19T00:00:00Z","timestamp":1603065600000},"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":[[2020,10,19]]},"DOI":"10.1145\/3340531.3412079","type":"proceedings-article","created":{"date-parts":[[2020,10,19]],"date-time":"2020-10-19T05:31:03Z","timestamp":1603085463000},"page":"2057-2060","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":2,"title":["Learning to Re-Rank with Contextualized Stopwords"],"prefix":"10.1145","author":[{"given":"Sebastian","family":"Hofst\u00e4tter","sequence":"first","affiliation":[{"name":"TU Wien, Vienna, Austria"}]},{"given":"Aldo","family":"Lipani","sequence":"additional","affiliation":[{"name":"University College London, London, United Kingdom"}]},{"given":"Markus","family":"Zlabinger","sequence":"additional","affiliation":[{"name":"TU Wien, Vienna, Austria"}]},{"given":"Allan","family":"Hanbury","sequence":"additional","affiliation":[{"name":"TU Wien, Vienna, Austria"}]}],"member":"320","published-online":{"date-parts":[[2020,10,19]]},"reference":[{"key":"e_1_3_2_2_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/1458082.1458157"},{"key":"e_1_3_2_2_2_1","volume-title":"Proc. of NIPS.","author":"Bajaj Payal","year":"2016","unstructured":"Payal Bajaj , Daniel Campos , Nick Craswell , 2016 . MS MARCO: A Human Generated MAchine Reading COmprehension Dataset . In Proc. of NIPS. Payal Bajaj, Daniel Campos, Nick Craswell, et almbox. 2016. MS MARCO: A Human Generated MAchine Reading COmprehension Dataset. In Proc. of NIPS."},{"key":"e_1_3_2_2_3_1","volume-title":"Overview of the TREC 2019 deep learning track. In TRE.","author":"Craswell Nick","year":"2019","unstructured":"Nick Craswell , Bhaskar Mitra , Emine Yilmaz , and Daniel Campos . 2019 . Overview of the TREC 2019 deep learning track. In TRE. Nick Craswell, Bhaskar Mitra, Emine Yilmaz, and Daniel Campos. 2019. Overview of the TREC 2019 deep learning track. In TRE."},{"key":"e_1_3_2_2_4_1","volume-title":"Context-aware sentence\/passage term importance estimation for first stage retrieval. arXiv preprint","author":"Dai Zhuyun","year":"1910","unstructured":"Zhuyun Dai and Jamie Callan . 2019. Context-aware sentence\/passage term importance estimation for first stage retrieval. arXiv preprint 1910 .10687 (2019). Zhuyun Dai and Jamie Callan. 2019. Context-aware sentence\/passage term importance estimation for first stage retrieval. arXiv preprint 1910.10687 (2019)."},{"key":"e_1_3_2_2_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/3159652.3159659"},{"key":"e_1_3_2_2_6_1","article-title":"When stopword lists make the difference","volume":"61","author":"Dolamic Ljiljana","year":"2010","unstructured":"Ljiljana Dolamic and Jacques Savoy . 2010 . When stopword lists make the difference . Journal of the American Society for IST , Vol. 61 (2010). Ljiljana Dolamic and Jacques Savoy. 2010. When stopword lists make the difference. Journal of the American Society for IST, Vol. 61 (2010).","journal-title":"Journal of the American Society for IST"},{"key":"e_1_3_2_2_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/2983323.2983769"},{"key":"e_1_3_2_2_8_1","volume-title":"Proc. of OSIRRC.","author":"Hofst\u00e4tter Sebastian","year":"2019","unstructured":"Sebastian Hofst\u00e4tter and Allan Hanbury . 2019 . Let's measure run time! Extending the IR replicability infrastructure to include performance aspects . In Proc. of OSIRRC. Sebastian Hofst\u00e4tter and Allan Hanbury. 2019. Let's measure run time! Extending the IR replicability infrastructure to include performance aspects. In Proc. of OSIRRC."},{"key":"e_1_3_2_2_9_1","volume-title":"Proc. of ECAI.","author":"Hofst\u00e4tter Sebastian","year":"2020","unstructured":"Sebastian Hofst\u00e4tter , Markus Zlabinger , and Allan Hanbury . 2020 a. Interpretable & Time-Budget-Constrained Contextualization for Re-Ranking . In Proc. of ECAI. Sebastian Hofst\u00e4tter, Markus Zlabinger, and Allan Hanbury. 2020 a. Interpretable & Time-Budget-Constrained Contextualization for Re-Ranking. In Proc. of ECAI."},{"key":"e_1_3_2_2_10_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-45442-5_58"},{"key":"e_1_3_2_2_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/3159652.3159689"},{"key":"e_1_3_2_2_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/2911451.2911473"},{"key":"e_1_3_2_2_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/2808194.2809495"},{"key":"e_1_3_2_2_15_1","volume-title":"An Updated Duet Model for Passage Re-ranking. arXiv preprint arXiv:1903.07666","author":"Mitra Bhaskar","year":"2019","unstructured":"Bhaskar Mitra and Nick Craswell . 2019. An Updated Duet Model for Passage Re-ranking. arXiv preprint arXiv:1903.07666 ( 2019 ). Bhaskar Mitra and Nick Craswell. 2019. An Updated Duet Model for Passage Re-ranking. arXiv preprint arXiv:1903.07666 (2019)."},{"key":"e_1_3_2_2_16_1","volume-title":"Passage Re-ranking with BERT. arXiv preprint arXiv:1901.04085","author":"Nogueira Rodrigo","year":"2019","unstructured":"Rodrigo Nogueira and Kyunghyun Cho . 2019. Passage Re-ranking with BERT. arXiv preprint arXiv:1901.04085 ( 2019 ). Rodrigo Nogueira and Kyunghyun Cho. 2019. Passage Re-ranking with BERT. arXiv preprint arXiv:1901.04085 (2019)."},{"key":"e_1_3_2_2_17_1","volume-title":"Understanding inverse document frequency: on theoretical arguments for IDF. Journal of documentation","author":"Robertson Stephen","year":"2004","unstructured":"Stephen Robertson . 2004. Understanding inverse document frequency: on theoretical arguments for IDF. Journal of documentation ( 2004 ). Stephen Robertson. 2004. Understanding inverse document frequency: on theoretical arguments for IDF. Journal of documentation (2004)."},{"key":"e_1_3_2_2_18_1","doi-asserted-by":"publisher","DOI":"10.1145\/3077136.3080809"},{"key":"e_1_3_2_2_19_1","doi-asserted-by":"publisher","DOI":"10.1145\/2983323.2983818"},{"key":"e_1_3_2_2_20_1","doi-asserted-by":"publisher","DOI":"10.1145\/3077136.3080721"},{"key":"e_1_3_2_2_21_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDIM.2011.6093315"},{"key":"e_1_3_2_2_22_1","volume-title":"mbox","author":"Hamed Zamani","year":"2018","unstructured":"Hamed Zamani et al mbox . 2018 . From Neural Re-Ranking to Neural Ranking : Learning a Sparse Representation for Inverted Indexing. In Proc. of CIKM. Hamed Zamani et almbox. 2018. From Neural Re-Ranking to Neural Ranking: Learning a Sparse Representation for Inverted Indexing. In Proc. of CIKM."}],"event":{"name":"CIKM '20: The 29th ACM International Conference on Information and Knowledge Management","sponsor":["SIGWEB ACM Special Interest Group on Hypertext, Hypermedia, and Web","SIGIR ACM Special Interest Group on Information Retrieval"],"location":"Virtual Event Ireland","acronym":"CIKM '20"},"container-title":["Proceedings of the 29th ACM International Conference on Information & Knowledge Management"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3340531.3412079","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3340531.3412079","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T22:02:30Z","timestamp":1750197750000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3340531.3412079"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,10,19]]},"references-count":21,"alternative-id":["10.1145\/3340531.3412079","10.1145\/3340531"],"URL":"https:\/\/doi.org\/10.1145\/3340531.3412079","relation":{},"subject":[],"published":{"date-parts":[[2020,10,19]]},"assertion":[{"value":"2020-10-19","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}