{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,24]],"date-time":"2026-03-24T11:49:11Z","timestamp":1774352951332,"version":"3.50.1"},"publisher-location":"New York, NY, USA","reference-count":60,"publisher":"ACM","license":[{"start":{"date-parts":[[2024,8,2]],"date-time":"2024-08-02T00:00:00Z","timestamp":1722556800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"funder":[{"DOI":"10.13039\/501100006374","name":"UK Research and Innovation","doi-asserted-by":"publisher","award":["EP\/S02266X\/1"],"award-info":[{"award-number":["EP\/S02266X\/1"]}],"id":[{"id":"10.13039\/501100006374","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2024,8,2]]},"DOI":"10.1145\/3664190.3672518","type":"proceedings-article","created":{"date-parts":[[2024,8,5]],"date-time":"2024-08-05T12:39:41Z","timestamp":1722861581000},"page":"15-24","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":3,"title":["Coherence-based Query Performance Measures for Dense Retrieval"],"prefix":"10.1145","author":[{"ORCID":"https:\/\/orcid.org\/0009-0008-8685-693X","authenticated-orcid":false,"given":"Maria","family":"Vlachou","sequence":"first","affiliation":[{"name":"University of Glasgow, Glasgow, United Kingdom"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-3143-279X","authenticated-orcid":false,"given":"Craig","family":"Macdonald","sequence":"additional","affiliation":[{"name":"University of Glasgow, Glasgow, United Kingdom"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2024,8,5]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-72240-1_15"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/3459637.3482063"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.ipm.2020.102248"},{"key":"e_1_3_2_1_4_1","volume-title":"Henrik Singmann, Bin Dai, Fabian Scheipl, and Gabor Grothendieck.","author":"Bates Douglas","year":"2009","unstructured":"Douglas Bates, Martin Maechler, Ben Bolker, Steven Walker, Rune Haubo Bojesen Christensen, Henrik Singmann, Bin Dai, Fabian Scheipl, and Gabor Grothendieck. 2009. Package 'lme4'. (2009)."},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0306-4573(00)00055-8"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/3477495.3531926"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.5555\/1855038"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/1148170.1148238"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-031-79468-1"},{"key":"e_1_3_2_1_10_1","volume-title":"Overview of the TREC 2019 deep learning track. arXiv preprint arXiv:2003","author":"Craswell Nick","year":"2020","unstructured":"Nick Craswell, Bhaskar Mitra, Emine Yilmaz, Daniel Campos, and Ellen M Voorhees. 2020. Overview of the TREC 2019 deep learning track. arXiv preprint arXiv:2003.07820 (2020)."},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/564376.564429"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/2009916.2010063"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1037\/0022-006X.65.1.130"},{"key":"e_1_3_2_1_14_1","volume-title":"Proc. SIGIR.","author":"Datta Suchana","year":"2022","unstructured":"Suchana Datta, Sean MacAvaney, Debasis Ganguly, and Derek Greene. 2022. A'Pointwise-Query, Listwise-Document'based Query Performance Prediction Approach. In Proc. SIGIR."},{"key":"e_1_3_2_1_15_1","volume-title":"BERT: Pre-training of deep bidirectional transformers for language understanding. arXiv preprint arXiv:1810.04805","author":"Devlin Jacob","year":"2018","unstructured":"Jacob Devlin, Ming-Wei Chang, Kenton Lee, and Kristina Toutanova. 2018. BERT: Pre-training of deep bidirectional transformers for language understanding. arXiv preprint arXiv:1810.04805 (2018)."},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/1277741.1277841"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1145\/3539618.3591625"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-031-28244-7_15"},{"key":"e_1_3_2_1_19_1","volume-title":"Proc. DESIRES.","author":"Faggioli Guglielmo","year":"2021","unstructured":"Guglielmo Faggioli, Stefano Marchesin, et al. 2021. What makes a query semantically hard?. In Proc. DESIRES."},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-72113-8_8"},{"key":"e_1_3_2_1_21_1","volume-title":"Discovering statistics using R. Discovering Statistics Using R","author":"Field Zo\u00eb","year":"2012","unstructured":"Zo\u00eb Field, Jeremy Miles, and Andy Field. 2012. Discovering statistics using R. Discovering Statistics Using R (2012), 1--992."},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1145\/1008992.1009104"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1145\/3341981.3344249"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1145\/1458082.1458311"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-30213-1_5"},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.18653\/v1\/2020.emnlp-main.550"},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1145\/3397271.3401075"},{"key":"e_1_3_2_1_28_1","volume-title":"Distilling dense representations for ranking using tightly-coupled teachers. arXiv preprint arXiv:2010.11386","author":"Lin Sheng-Chieh","year":"2020","unstructured":"Sheng-Chieh Lin, Jheng-Hong Yang, and Jimmy Lin. 2020. Distilling dense representations for ranking using tightly-coupled teachers. arXiv preprint arXiv:2010.11386 (2020)."},{"key":"e_1_3_2_1_29_1","volume-title":"A syntactically-based query reformulation technique for information retrieval. Information processing & management","author":"Lioma Christina","year":"2008","unstructured":"Christina Lioma and Iadh Ounis. 2008. A syntactically-based query reformulation technique for information retrieval. Information processing & management, Vol. 44, 1 (2008), 143--162."},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1145\/3459637.3482013"},{"key":"e_1_3_2_1_31_1","volume-title":"Introduction to general and generalized linear models","author":"Madsen Henrik","unstructured":"Henrik Madsen and Poul Thyregod. 2010. Introduction to general and generalized linear models. CRC Press."},{"key":"e_1_3_2_1_32_1","volume-title":"Designing experiments and analyzing data: A model comparison perspective","author":"Maxwell Scott E","unstructured":"Scott E Maxwell, Harold D Delaney, and Ken Kelley. 2017. Designing experiments and analyzing data: A model comparison perspective. Routledge."},{"key":"e_1_3_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.1145\/290941.290995"},{"key":"e_1_3_2_1_34_1","volume-title":"ACM Conference on research and Development in Information Retrieval, SIGIR, Predicting query difficulty-methods and applications workshop. 7--10","author":"Mothe Josiane","year":"2005","unstructured":"Josiane Mothe and Ludovic Tanguy. 2005. Linguistic features to predict query difficulty. In ACM Conference on research and Development in Information Retrieval, SIGIR, Predicting query difficulty-methods and applications workshop. 7--10."},{"key":"e_1_3_2_1_35_1","doi-asserted-by":"publisher","DOI":"10.2307\/2344614"},{"key":"e_1_3_2_1_36_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)."},{"key":"e_1_3_2_1_37_1","volume-title":"Document ranking with a pretrained sequence-to-sequence model. arXiv preprint arXiv:2003.06713","author":"Nogueira Rodrigo","year":"2020","unstructured":"Rodrigo Nogueira, Zhiying Jiang, and Jimmy Lin. 2020. Document ranking with a pretrained sequence-to-sequence model. arXiv preprint arXiv:2003.06713 (2020)."},{"key":"e_1_3_2_1_38_1","volume-title":"Proceedings of ACM SIGIR'06 Workshop on Open Source Information Retrieval (OSIR","author":"Ounis I.","year":"2006","unstructured":"I. Ounis, G. Amati, V. Plachouras, B. He, C. Macdonald, and C. Lioma. 2006. Terrier: A High Performance and Scalable Information Retrieval Platform. In Proceedings of ACM SIGIR'06 Workshop on Open Source Information Retrieval (OSIR 2006)."},{"key":"e_1_3_2_1_39_1","volume-title":"Proc","author":"P\u00e9rez-Iglesias Joaqu\u00edn","unstructured":"Joaqu\u00edn P\u00e9rez-Iglesias and Lourdes Araujo. 2010. Standard deviation as a query hardness estimator. In Proc. SPIRE. Springer, 207--212."},{"key":"e_1_3_2_1_40_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.ipm.2005.05.005"},{"key":"e_1_3_2_1_41_1","volume-title":"Proc","author":"Robertson Stephen E","unstructured":"Stephen E Robertson and Steve Walker. 1994. Some simple effective approximations to the 2-poisson model for probabilistic weighted retrieval. In Proc. SIGIR. Springer."},{"key":"e_1_3_2_1_42_1","doi-asserted-by":"publisher","DOI":"10.1145\/3121050.3121051"},{"key":"e_1_3_2_1_43_1","doi-asserted-by":"publisher","DOI":"10.1145\/3121050.3121087"},{"key":"e_1_3_2_1_44_1","volume-title":"Estimating gaussian mixture models in the local neighbourhood of embedded word vectors for query performance prediction. Information processing & management","author":"Roy Dwaipayan","year":"2019","unstructured":"Dwaipayan Roy, Debasis Ganguly, Mandar Mitra, and Gareth JF Jones. 2019. Estimating gaussian mixture models in the local neighbourhood of embedded word vectors for query performance prediction. Information processing & management, Vol. 56, 3 (2019), 1026--1045."},{"key":"e_1_3_2_1_45_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-031-56066-8_4"},{"key":"e_1_3_2_1_46_1","doi-asserted-by":"publisher","DOI":"10.1145\/1571941.1572055"},{"key":"e_1_3_2_1_47_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-04417-5_30"},{"key":"e_1_3_2_1_48_1","doi-asserted-by":"publisher","DOI":"10.1145\/1835449.1835494"},{"key":"e_1_3_2_1_49_1","doi-asserted-by":"publisher","DOI":"10.1145\/2180868.2180873"},{"key":"e_1_3_2_1_50_1","volume-title":"Applied longitudinal data analysis: Modeling change and event occurrence","author":"Singer Judith D","unstructured":"Judith D Singer and John B Willett. 2003. Applied longitudinal data analysis: Modeling change and event occurrence. Oxford university press."},{"key":"e_1_3_2_1_51_1","doi-asserted-by":"publisher","DOI":"10.1145\/2661829.2661906"},{"key":"e_1_3_2_1_52_1","volume-title":"R: A language and environment for statistical computing. Published online","author":"Team R Core","year":"2021","unstructured":"R Core Team. 2021. R: A language and environment for statistical computing. Published online 2020."},{"key":"e_1_3_2_1_53_1","volume-title":"Overview of the TREC 2003 robust retrieval track. In Proc. TREC. 69--77","author":"Voorhees Ellen M","year":"2003","unstructured":"Ellen M Voorhees. 2003. Overview of the TREC 2003 robust retrieval track. In Proc. TREC. 69--77."},{"key":"e_1_3_2_1_54_1","volume-title":"Deep reinforced query reformulation for information retrieval. arXiv preprint arXiv:2007.07987","author":"Wang Xiao","year":"2020","unstructured":"Xiao Wang, Craig Macdonald, and Iadh Ounis. 2020. Deep reinforced query reformulation for information retrieval. arXiv preprint arXiv:2007.07987 (2020)."},{"key":"e_1_3_2_1_55_1","doi-asserted-by":"publisher","DOI":"10.1145\/3471158.3472250"},{"key":"e_1_3_2_1_56_1","volume-title":"Approximate nearest neighbor negative contrastive learning for dense text retrieval. arXiv preprint arXiv:2007.00808","author":"Xiong Lee","year":"2020","unstructured":"Lee Xiong, Chenyan Xiong, Ye Li, Kwok-Fung Tang, Jialin Liu, Paul Bennett, Junaid Ahmed, and Arnold Overwijk. 2020. Approximate nearest neighbor negative contrastive learning for dense text retrieval. arXiv preprint arXiv:2007.00808 (2020)."},{"key":"e_1_3_2_1_57_1","doi-asserted-by":"publisher","DOI":"10.1145\/3459637.3482124"},{"key":"e_1_3_2_1_58_1","doi-asserted-by":"publisher","DOI":"10.1145\/3209978.3210041"},{"key":"e_1_3_2_1_59_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-78646-7_8"},{"key":"e_1_3_2_1_60_1","doi-asserted-by":"publisher","DOI":"10.1145\/1277741.1277835"}],"event":{"name":"ICTIR '24: The 2024 ACM SIGIR International Conference on the Theory of Information Retrieval","location":"Washington DC USA","acronym":"ICTIR '24","sponsor":["SIGIR ACM Special Interest Group on Information Retrieval"]},"container-title":["Proceedings of the 2024 ACM SIGIR International Conference on Theory of Information Retrieval"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3664190.3672518","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3664190.3672518","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,8,22]],"date-time":"2025-08-22T23:58:02Z","timestamp":1755907082000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3664190.3672518"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,8,2]]},"references-count":60,"alternative-id":["10.1145\/3664190.3672518","10.1145\/3664190"],"URL":"https:\/\/doi.org\/10.1145\/3664190.3672518","relation":{},"subject":[],"published":{"date-parts":[[2024,8,2]]},"assertion":[{"value":"2024-08-05","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}