{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,25]],"date-time":"2026-03-25T01:00:45Z","timestamp":1774400445045,"version":"3.50.1"},"publisher-location":"Cham","reference-count":40,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783031282379","type":"print"},{"value":"9783031282386","type":"electronic"}],"license":[{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2023]]},"DOI":"10.1007\/978-3-031-28238-6_31","type":"book-chapter","created":{"date-parts":[[2023,3,16]],"date-time":"2023-03-16T17:03:18Z","timestamp":1678986198000},"page":"414-422","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":30,"title":["Doc2Query\u2013: When Less is More"],"prefix":"10.1007","author":[{"given":"Mitko","family":"Gospodinov","sequence":"first","affiliation":[]},{"given":"Sean","family":"MacAvaney","sequence":"additional","affiliation":[]},{"given":"Craig","family":"Macdonald","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2023,3,17]]},"reference":[{"key":"31_CR1","doi-asserted-by":"crossref","unstructured":"Amati, G., Van Rijsbergen, C.J.: Probabilistic models of information retrieval based on measuring the divergence from randomness. ACM Trans. Inf. Syst. 20(4), 357\u2013389 (2002)","DOI":"10.1145\/582415.582416"},{"key":"31_CR2","doi-asserted-by":"crossref","unstructured":"Bonifacio, L., Abonizio, H., Fadaee, M., Nogueira, R.: InPars: unsupervised dataset generation for information retrieval. In: Proceedings of SIGIR (2022)","DOI":"10.1145\/3477495.3531863"},{"key":"31_CR3","doi-asserted-by":"crossref","unstructured":"Dai, Z., Callan, J.: Deeper text understanding for IR with contextual neural language modeling. In: Proceedings of SIGIR (2019)","DOI":"10.1145\/3331184.3331303"},{"key":"31_CR4","doi-asserted-by":"crossref","unstructured":"Dai, Z., Callan, J.: Context-aware document term weighting for ad-hoc search. In: Proceedings of the Web Conference (2020)","DOI":"10.1145\/3366423.3380258"},{"key":"31_CR5","unstructured":"Das, R., Dhuliawala, S., Zaheer, M., McCallum, A.: Multi-step retriever-reader interaction for scalable open-domain question answering. In: Proceedings of ICLR (2019)"},{"key":"31_CR6","unstructured":"Devlin, J., Chang, M.W., Lee, K., Toutanova, K.: BERT: pre-training of deep bidirectional transformers for language understanding. In: Proceedings of NAACL-HLT (2019)"},{"key":"31_CR7","doi-asserted-by":"crossref","unstructured":"Ding, S., Suel, T.: Faster top-k document retrieval using block-max indexes. In: Proceedings of SIGIR (2011)","DOI":"10.1145\/2009916.2010048"},{"key":"31_CR8","doi-asserted-by":"crossref","unstructured":"Dumais, S.T., Furnas, G.W., Landauer, T.K., Deerwester, S., Harshman, R.: Using latent semantic analysis to improve access to textual information. In: Proceedings of SIGCHI CHI (1988)","DOI":"10.1145\/57167.57214"},{"key":"31_CR9","doi-asserted-by":"crossref","unstructured":"Efron, M., Organisciak, P., Fenlon, K.: Improving retrieval of short texts through document expansion. In: Proceedings of SIGIR (2012)","DOI":"10.1145\/2348283.2348405"},{"key":"31_CR10","doi-asserted-by":"crossref","unstructured":"Formal, T., Piwowarski, B., Clinchant, S.: SPLADE: sparse lexical and expansion model for first stage ranking. In: Proceedings of SIGIR (2021)","DOI":"10.1145\/3404835.3463098"},{"key":"31_CR11","doi-asserted-by":"crossref","unstructured":"He, B., Ounis, I.: Studying query expansion effectiveness. In: Proceedings of ECIR (2009)","DOI":"10.1007\/978-3-642-00958-7_57"},{"key":"31_CR12","doi-asserted-by":"crossref","unstructured":"Jaleel, N.A., et al.: Umass at TREC 2004: novelty and HARD. In: TREC (2004)","DOI":"10.6028\/NIST.SP.500-261.novelty-u.mass"},{"key":"31_CR13","doi-asserted-by":"crossref","unstructured":"Johnson, J., Douze, M., Jegou, H.: Billion-scale similarity search with GPUs. IEEE Trans. Big Data 7(03), 535\u2013547 (2021)","DOI":"10.1109\/TBDATA.2019.2921572"},{"key":"31_CR14","doi-asserted-by":"crossref","unstructured":"Khattab, O., Zaharia, M.: ColBERT: efficient and effective passage search via contextualized late interaction over BERT. In: Proceedings of SIGIR (2020)","DOI":"10.1145\/3397271.3401075"},{"key":"31_CR15","unstructured":"Lin, J., Ma, X., Mackenzie, J., Mallia, A.: On the separation of logical and physical ranking models for text retrieval applications. In: Proceedings of DESIRES (2021)"},{"key":"31_CR16","doi-asserted-by":"crossref","unstructured":"Lin, S.C., Yang, J.H., Lin, J.: In-batch negatives for knowledge distillation with tightly-coupled teachers for dense retrieval. In: Proceedings of RepL4NLP (2021)","DOI":"10.18653\/v1\/2021.repl4nlp-1.17"},{"key":"31_CR17","doi-asserted-by":"crossref","unstructured":"MacAvaney, S., Macdonald, C.: A python interface to PISA! In: Proceedings of SIGIR (2022)","DOI":"10.1145\/3477495.3531656"},{"key":"31_CR18","doi-asserted-by":"crossref","unstructured":"MacAvaney, S., Macdonald, C., Ounis, I.: Streamlining evaluation with ir-measures. In: Proceedings of ECIR (2022)","DOI":"10.1007\/978-3-030-99739-7_38"},{"key":"31_CR19","doi-asserted-by":"crossref","unstructured":"MacAvaney, S., Nardini, F.M., Perego, R., Tonellotto, N., Goharian, N., Frieder, O.: Expansion via prediction of importance with contextualization. In: Proceedings of SIGIR (2020)","DOI":"10.1145\/3397271.3401262"},{"key":"31_CR20","doi-asserted-by":"crossref","unstructured":"MacAvaney, S., Tonellotto, N., Macdonald, C.: Adaptive re-ranking with a corpus graph. In: Proceedings of CIKM (2022)","DOI":"10.1145\/3511808.3557231"},{"key":"31_CR21","doi-asserted-by":"crossref","unstructured":"MacAvaney, S., Yates, A., Feldman, S., Downey, D., Cohan, A., Goharian, N.: Simplified data wrangling with ir_datasets. In: Proceedings of SIGIR (2021)","DOI":"10.1145\/3404835.3463254"},{"key":"31_CR22","doi-asserted-by":"crossref","unstructured":"Macdonald, C., Tonellotto, N.: Declarative experimentation in information retrieval using PyTerrier. In: Proceedings of ICTIR (2020)","DOI":"10.1145\/3409256.3409829"},{"key":"31_CR23","doi-asserted-by":"crossref","unstructured":"Mallia, A., Khattab, O., Suel, T., Tonellotto, N.: Learning passage impacts for inverted indexes. In: Proceedings of SIGIR (2021)","DOI":"10.1145\/3404835.3463030"},{"key":"31_CR24","unstructured":"Mallia, A., Siedlaczek, M., Mackenzie, J., Suel, T.: PISA: performant indexes and search for academia. In: Proceedings of OSIRRC@SIGIR (2019)"},{"key":"31_CR25","doi-asserted-by":"crossref","unstructured":"Maynez, J., Narayan, S., Bohnet, B., McDonald, R.: On faithfulness and factuality in abstractive summarization. In: Proceedings of ACL (2020)","DOI":"10.18653\/v1\/2020.acl-main.173"},{"key":"31_CR26","unstructured":"Nguyen, T., Rosenberg, M., Song, X., Gao, J., Tiwary, S., Majumder, R., Deng, L.: MS MARCO: a human generated machine reading comprehension dataset. In: Proceedings of CoCo@NIPS (2016)"},{"key":"31_CR27","unstructured":"Nogueira, R., Cho, K.: Passage re-ranking with BERT. ArXiv abs\/1901.04085 (2019)"},{"key":"31_CR28","unstructured":"Nogueira, R., Lin, J.: From doc2query to doctttttquery (2019)"},{"key":"31_CR29","unstructured":"Nogueira, R., Yang, W., Lin, J.J., Cho, K.: Document expansion by query prediction. ArXiv abs\/1904.08375 (2019)"},{"key":"31_CR30","doi-asserted-by":"crossref","unstructured":"Pickens, J., Cooper, M., Golovchinsky, G.: Reverted indexing for feedback and expansion. In: Proceedings of CIKM (2010)","DOI":"10.1145\/1871437.1871571"},{"key":"31_CR31","doi-asserted-by":"crossref","unstructured":"Pradeep, R., Liu, Y., Zhang, X., Li, Y., Yates, A., Lin, J.: Squeezing water from a stone: a bag of tricks for further improving cross-encoder effectiveness for reranking. In: Proceedings of ECIR (2022)","DOI":"10.1007\/978-3-030-99736-6_44"},{"key":"31_CR32","doi-asserted-by":"crossref","unstructured":"Pradeep, R., Nogueira, R., Lin, J.: The expando-mono-duo design pattern for text ranking with pretrained sequence-to-sequence models. ArXiv abs\/2101.05667 (2021)","DOI":"10.18653\/v1\/2020.findings-emnlp.63"},{"key":"31_CR33","unstructured":"Raffel, C., et al.: Exploring the limits of transfer learning with a unified text-to-text transformer. J. Mach. Learn. Res. 21(140), 5485\u20135551 (2020)"},{"key":"31_CR34","doi-asserted-by":"crossref","unstructured":"Scells, H., Zhuang, S., Zuccon, G.: Reduce, reuse, recycle: green information retrieval research. In: Proceedings of SIGIR (2022)","DOI":"10.1145\/3477495.3531766"},{"key":"31_CR35","doi-asserted-by":"crossref","unstructured":"Tao, T., Wang, X., Mei, Q., Zhai, C.: Language model information retrieval with document expansion. In: Proceedings of HLT-NAACL (2006)","DOI":"10.3115\/1220835.1220887"},{"key":"31_CR36","doi-asserted-by":"crossref","unstructured":"Wang, X., MacAvaney, S., Macdonald, C., Ounis, I.: An inspection of the reproducibility and replicability of TCT-ColBERT. In: Proceedings of SIGIR (2022)","DOI":"10.1145\/3477495.3531721"},{"key":"31_CR37","unstructured":"Xiong, L., Xiong, C., Li, Y., Tang, K.F., Liu, J., Bennett, P.N., Ahmed, J., Overwijk, A.: Approximate nearest neighbor negative contrastive learning for dense text retrieval. In: Proceedings of ICLR (2021)"},{"key":"31_CR38","doi-asserted-by":"crossref","unstructured":"Yu, S.Y., Liu, J., Yang, J., Xiong, C., Bennett, P.N., Gao, J., Liu, Z.: Few-shot generative conversational query rewriting. In: Proceedings of SIGIR (2020)","DOI":"10.1145\/3397271.3401323"},{"key":"31_CR39","doi-asserted-by":"crossref","unstructured":"Zhao, T., Lu, X., Lee, K.: SPARTA: efficient open-domain question answering via sparse transformer matching retrieval. arXiv abs\/2009.13013 (2020)","DOI":"10.18653\/v1\/2021.naacl-main.47"},{"key":"31_CR40","doi-asserted-by":"crossref","unstructured":"Zhuang, S., Zuccon, G.: TILDE: term independent likelihood model for passage re-ranking. In: Proceedings of SIGIR (2021)","DOI":"10.1145\/3404835.3462922"}],"container-title":["Lecture Notes in Computer Science","Advances in Information Retrieval"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-28238-6_31","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,10,16]],"date-time":"2024-10-16T15:10:30Z","timestamp":1729091430000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-28238-6_31"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"ISBN":["9783031282379","9783031282386"],"references-count":40,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-28238-6_31","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023]]},"assertion":[{"value":"17 March 2023","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ECIR","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"European Conference on Information Retrieval","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Dublin","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Ireland","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2023","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2 April 2023","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"6 April 2023","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"45","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"ecir2023","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/ecir2023.org\/index.html?v=1.0","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Double-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"489","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"77","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"83","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"16% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"No","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}