{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,13]],"date-time":"2026-05-13T13:43:03Z","timestamp":1778679783596,"version":"3.51.4"},"publisher-location":"Cham","reference-count":33,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783031560590","type":"print"},{"value":"9783031560606","type":"electronic"}],"license":[{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"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":[[2024]]},"DOI":"10.1007\/978-3-031-56060-6_23","type":"book-chapter","created":{"date-parts":[[2024,3,15]],"date-time":"2024-03-15T15:02:17Z","timestamp":1710514937000},"page":"349-363","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Two-Step SPLADE: Simple, Efficient and\u00a0Effective Approximation of\u00a0SPLADE"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-7754-6656","authenticated-orcid":false,"given":"Carlos","family":"Lassance","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-9837-5358","authenticated-orcid":false,"given":"Herv\u00e9","family":"Dejean","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-2367-8837","authenticated-orcid":false,"given":"St\u00e9phane","family":"Clinchant","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-7427-1001","authenticated-orcid":false,"given":"Nicola","family":"Tonellotto","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2024,3,16]]},"reference":[{"key":"23_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"675","DOI":"10.1007\/978-3-642-00958-7_65","volume-title":"Advances in Information Retrieval","author":"IS Altingovde","year":"2009","unstructured":"Altingovde, I.S., Ozcan, R., Ulusoy, \u00d6.: A practitioner\u2019s guide for static index pruning. In: Boughanem, M., Berrut, C., Mothe, J., Soule-Dupuy, C. (eds.) ECIR 2009. LNCS, vol. 5478, pp. 675\u2013679. Springer, Heidelberg (2009). https:\/\/doi.org\/10.1007\/978-3-642-00958-7_65"},{"key":"23_CR2","doi-asserted-by":"crossref","unstructured":"Broder, A.Z., Carmel, D., Herscovici, M., Soffer, A., Zien, J.: Efficient query evaluation using a two-level retrieval process. In: Proceedings of the Twelfth International Conference on Information and Knowledge Management, pp. 426\u2013434 (2003)","DOI":"10.1145\/956863.956944"},{"key":"23_CR3","doi-asserted-by":"crossref","unstructured":"Bruch, S., Nardini, F.M., Ingber, A., Liberty, E.: An approximate algorithm for maximum inner product search over streaming sparse vectors. arXiv preprint arXiv:2301.10622 (2023)","DOI":"10.1145\/3609797"},{"key":"23_CR4","doi-asserted-by":"crossref","unstructured":"Bruch, S., Nardini, F.M., Ingber, A., Liberty, E.: Bridging dense and sparse maximum inner product search. arXiv preprint arXiv:2309.09013 (2023)","DOI":"10.1145\/3665324"},{"key":"23_CR5","doi-asserted-by":"crossref","unstructured":"B\u00fcttcher, S., Clarke, C.L.: A document-centric approach to static index pruning in text retrieval systems. In: Proceedings of the 15th ACM International Conference on Information and Knowledge Management, pp. 182\u2013189 (2006)","DOI":"10.1145\/1183614.1183644"},{"key":"23_CR6","doi-asserted-by":"crossref","unstructured":"Carmel, D., Cohen, D., Fagin, R., Farchi, E., Herscovici, M., Maarek, Y.S., Soffer, A.: Static index pruning for information retrieval systems. In: Proceedings of the 24th Annual International ACM SIGIR Conference on Research and Development in Information Retrieval, pp. 43\u201350 (2001)","DOI":"10.1145\/383952.383958"},{"key":"23_CR7","doi-asserted-by":"crossref","unstructured":"Chen, R.C., Lee, C.J.: An information-theoretic account of static index pruning. In: Proceedings of the 36th International ACM SIGIR Conference on Research and Development in Information Retrieval, pp. 163\u2013172 (2013)","DOI":"10.1145\/2484028.2484061"},{"key":"23_CR8","unstructured":"Devlin, J., Chang, M.W., Lee, K., Toutanova, K.: BERT: pre-training of deep bidirectional transformers for language understanding. In: Proceedings of NAACL, pp. 4171\u20134186 (2019)"},{"key":"23_CR9","doi-asserted-by":"crossref","unstructured":"Ding, S., Suel, T.: Faster top-k document retrieval using block-max indexes. In: Proceedings of the 34th International ACM SIGIR Conference on Research and Development in Information Retrieval, pp. 993\u20131002 (2011)","DOI":"10.1145\/2009916.2010048"},{"key":"23_CR10","doi-asserted-by":"crossref","unstructured":"Formal, T., Lassance, C., Piwowarski, B., Clinchant, S.: From distillation to hard negative sampling: making sparse neural ir models more effective. In: Proceedings of the 45th International ACM SIGIR Conference on Research and Development in Information Retrieval, pp. 2353\u20132359 (2022)","DOI":"10.1145\/3477495.3531857"},{"key":"23_CR11","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, pp. 2288\u20132292 (2021)","DOI":"10.1145\/3404835.3463098"},{"key":"23_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"20","DOI":"10.1007\/978-3-030-45442-5_3","volume-title":"Advances in Information Retrieval","author":"A Grand","year":"2020","unstructured":"Grand, A., Muir, R., Ferenczi, J., Lin, J.: From MAXSCORE to block-max Wand: the story of how lucene significantly improved query evaluation performance. In: Jose, J.M., et al. (eds.) ECIR 2020. LNCS, vol. 12036, pp. 20\u201327. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-45442-5_3"},{"key":"23_CR13","doi-asserted-by":"crossref","unstructured":"Kulkarni, H., MacAvaney, S., Goharian, N., Frieder, O.: Lexically-accelerated dense retrieval. In: Proceedings of the 46th International ACM SIGIR Conference on Research and Development in Information Retrieval, pp. 152\u2013162 (2023)","DOI":"10.1145\/3539618.3591715"},{"key":"23_CR14","doi-asserted-by":"crossref","unstructured":"Lassance, C., Clinchant, S.: An efficiency study for splade models. In: Proceedings of the 45th International ACM SIGIR Conference on Research and Development in Information Retrieval, pp. 2220\u20132226 (2022)","DOI":"10.1145\/3477495.3531833"},{"key":"23_CR15","doi-asserted-by":"crossref","unstructured":"Lassance, C., Lupart, S., Dejean, H., Clinchant, S., Tonellotto, N.: A static pruning study on sparse neural retrievers. arXiv preprint arXiv:2304.12702 (2023)","DOI":"10.1145\/3539618.3591941"},{"key":"23_CR16","doi-asserted-by":"crossref","unstructured":"MacAvaney, S., Tonellotto, N., Macdonald, C.: Adaptive re-ranking with a corpus graph. In: Proceedings of the 31st ACM International Conference on Information and Knowledge Management, pp. 1491\u20131500 (2022)","DOI":"10.1145\/3511808.3557231"},{"key":"23_CR17","doi-asserted-by":"crossref","unstructured":"Mackenzie, J., Mallia, A., Moffat, A., Petri, M.: Accelerating learned sparse indexes via term impact decomposition. In: Findings of the Association for Computational Linguistics: EMNLP 2022, pp. 2830\u20132842. Association for Computational Linguistics, Abu Dhabi, United Arab Emirates, December 2022 (2022). https:\/\/aclanthology.org\/2022.findings-emnlp.205","DOI":"10.18653\/v1\/2022.findings-emnlp.205"},{"issue":"4","key":"23_CR18","first-page":"1","volume":"41","author":"J Mackenzie","year":"2023","unstructured":"Mackenzie, J., Trotman, A., Lin, J.: Efficient document-at-a-time and score-at-a-time query evaluation for learned sparse representations. ACM Trans. Inf. Syst. 41(4), 1\u201328 (2023)","journal-title":"ACM Trans. Inf. Syst."},{"key":"23_CR19","doi-asserted-by":"crossref","unstructured":"Mallia, A., Khattab, O., Suel, T., Tonellotto, N.: Learning passage impacts for inverted indexes. In: Proceedings of SIGIR, pp. 1723\u20131727 (2021)","DOI":"10.1145\/3404835.3463030"},{"key":"23_CR20","doi-asserted-by":"crossref","unstructured":"Mallia, A., Mackenzie, J., Suel, T., Tonellotto, N.: Faster learned sparse retrieval with guided traversal. In: Proceedings of the 45th International ACM SIGIR Conference on Research and Development in Information Retrieval, pp. 1901\u20131905 (2022)","DOI":"10.1145\/3477495.3531774"},{"key":"23_CR21","unstructured":"Mallia, A., Siedlaczek, M., Mackenzie, J., Suel, T.: Pisa: performant indexes and search for academia. In: Proceedings of the Open-Source IR Replicability Challenge (2019)"},{"key":"23_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"101","DOI":"10.1007\/978-3-031-28241-6_7","volume-title":"Advances in Information Retrieval - ECIR 2023","author":"T Nguyen","year":"2023","unstructured":"Nguyen, T., MacAvaney, S., Yates, A.: A unified framework for learned sparse retrieval. In: Kamps, J., et al. (eds.) ECIR 2023. LNCS, vol. 13982, pp. 101\u2013116. Springer, Cham (2023). https:\/\/doi.org\/10.1007\/978-3-031-28241-6_7"},{"key":"23_CR23","doi-asserted-by":"crossref","unstructured":"Qiao, Y., Yang, Y., He, S., Yang, T.: Representation sparsification with hybrid thresholding for fast splade-based document retrieval. arXiv preprint arXiv:2306.11293 (2023)","DOI":"10.1145\/3539618.3592051"},{"key":"23_CR24","doi-asserted-by":"crossref","unstructured":"Qiao, Y., Yang, Y., Lin, H., Yang, T.: Optimizing guided traversal for fast learned sparse retrieval. In: Proceedings of the ACM Web Conference 2023, pp. 3375\u20133385 (2023)","DOI":"10.1145\/3543507.3583497"},{"key":"23_CR25","doi-asserted-by":"crossref","unstructured":"Santhanam, K., Khattab, O., Saad-Falcon, J., Potts, C., Zaharia, M.: Colbertv2: effective and efficient retrieval via lightweight late interaction. arXiv preprint arXiv:2112.01488 (2021)","DOI":"10.18653\/v1\/2022.naacl-main.272"},{"key":"23_CR26","doi-asserted-by":"crossref","unstructured":"Sertkan, M., Althammer, S., Hofst\u00e4tter, S.: Ranger: a toolkit for effect-size based multi-task evaluation. arXiv preprint arXiv:2305.15048 (2023)","DOI":"10.18653\/v1\/2023.acl-demo.56"},{"key":"23_CR27","unstructured":"Sertkan, M., Althammer, S., Hofst\u00e4tter, S., Knees, P., Neidhardt, J.: Exploring effect-size-based meta-analysis for multi-dataset evaluation (2023)"},{"key":"23_CR28","unstructured":"Shen, T., et al.: LexMAE: lexicon-bottlenecked pretraining for large-scale retrieval. In: International Conference on Learning Representations (2023). https:\/\/openreview.net\/forum?id=PfpEtB3-csK"},{"key":"23_CR29","unstructured":"Thakur, N., Reimers, N., R\u00fcckl\u00e9, A., Srivastava, A., Gurevych, I.: Beir: a heterogenous benchmark for zero-shot evaluation of information retrieval models. arXiv preprint arXiv:2104.08663 (2021)"},{"issue":"4\u20135","key":"23_CR30","doi-asserted-by":"publisher","first-page":"319","DOI":"10.1561\/1500000057","volume":"12","author":"N Tonellotto","year":"2018","unstructured":"Tonellotto, N., Macdonald, C., Ounis, I.: Efficient query processing for scalable web search. Found. Trends in Inf. Retr. 12(4\u20135), 319\u2013492 (2018)","journal-title":"Found. Trends in Inf. Retr."},{"issue":"6","key":"23_CR31","doi-asserted-by":"publisher","first-page":"831","DOI":"10.1016\/0306-4573(95)00020-H","volume":"31","author":"H Turtle","year":"1995","unstructured":"Turtle, H., Flood, J.: Query evaluation: strategies and optimizations. Inf. Process. Manag. 31(6), 831\u2013850 (1995)","journal-title":"Inf. Process. Manag."},{"key":"23_CR32","doi-asserted-by":"crossref","unstructured":"Yang, P., Fang, H., Lin, J.: Anserini: enabling the use of Lucene for information retrieval research. In: Proceedings of the 40th International ACM SIGIR Conference on Research and Development in Information Retrieval, pp. 1253\u20131256 (2017)","DOI":"10.1145\/3077136.3080721"},{"key":"23_CR33","doi-asserted-by":"publisher","unstructured":"Zhao, T., Lu, X., Lee, K.: SPARTA: efficient open-domain question answering via sparse transformer matching retrieval. In: Toutanova, K., et al. (eds.) Proceedings of the 2021 Conference of the North American Chapter of the Association for Computational Linguistics: Human Language Technologies, NAACL-HLT 2021, Online, 6\u201311 June 2021, pp. 565\u2013575. Association for Computational Linguistics (2021). https:\/\/doi.org\/10.18653\/v1\/2021.naacl-main.47","DOI":"10.18653\/v1\/2021.naacl-main.47"}],"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-56060-6_23","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,11,14]],"date-time":"2024-11-14T11:11:16Z","timestamp":1731582676000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-56060-6_23"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024]]},"ISBN":["9783031560590","9783031560606"],"references-count":33,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-56060-6_23","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024]]},"assertion":[{"value":"16 March 2024","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":"Glasgow","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"United Kingdom","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2024","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"24 March 2024","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"28 March 2024","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"ecir2024","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/www.ecir2024.org\/","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":"578","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":"110","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":"69","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":"19% - 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":"4","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)"}},{"value":"31 (Tracks: Workshop, Tutorial, Industry, Doctoral Consortium)","order":10,"name":"additional_info_on_review_process","label":"Additional Info on Review Process","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}