paper-with-me

Papers

Can ChatGPT Write a Good Boolean Query for Systematic Review Literature Search?

2023-02-03 · Shuai Wang, Harrisen Scells, Bevan Koopman, Guido Zuccon

Systematic reviews are comprehensive reviews of the literature for a highly focused research question. These reviews are often treated as the highest form of evidence in evidence-based medicine, and are the key strategy to answer research questions in the medical field. To create a high-quality systematic review, complex Boolean queries are often constructed to retrieve studies for the review topic. However, it often takes a long time for systematic review researchers to construct a high quality systematic review Boolean query, and often the resulting queries are far from effective. Poor queries may lead to biased or invalid reviews, because they missed to retrieve key evidence, or to extensive increase in review costs, because they retrieved too many irrelevant studies. Recent advances in Transformer-based generative models have shown great potential to effectively follow instructions from users and generate answers based on the instructions being made. In this paper, we investigate the effectiveness of the latest of such models, ChatGPT, in generating effective Boolean queries for systematic review literature search. Through a number of extensive experiments on standard test collections for the task, we find that ChatGPT is capable of generating queries that lead to high search precision, although trading-off this for recall. Overall, our study demonstrates the potential of ChatGPT in generating effective Boolean queries for systematic review literature search. The ability of ChatGPT to follow complex instructions and generate queries with high precision makes it a valuable tool for researchers conducting systematic reviews, particularly for rapid reviews where time is a constraint and often trading-off higher precision for lower recall is acceptable.

📄 PDF Abstract BibTeX arXiv:2302.03495

Code (0)

등록된 구현이 없습니다.

Methods 이 논문이 사용한 방법론

Test 설명 없음

Similar Papers 제목 키워드 기반

A Reproducibility and Generalizability Study of Large Language Models for Query Generation

2024-11-22 · Moritz Staudinger, Wojciech Kusa, Florina Piroi, Aldo Lipani 외

Systematic literature reviews (SLRs) are a cornerstone of academic research, yet they are often labour-intensive and time-consuming due to the detailed literature curation process. The advent of generative AI and large l…

Information RetrievalRetrieval

Reassessing Large Language Model Boolean Query Generation for Systematic Reviews

2025-05-12 · Shuai Wang, Harrisen Scells, Bevan Koopman, Guido Zuccon

Systematic reviews are comprehensive literature reviews that address highly focused research questions and represent the highest form of evidence in medicine. A critical step in this process is the development of complex…

Language ModelingLanguage ModellingLarge Language ModelModel Selection

Generating Natural Language Queries for More Effective Systematic Review Screening Prioritisation

2023-09-11 · Shuai Wang, Harrisen Scells, Martin Potthast, Bevan Koopman 외

Screening prioritisation in medical systematic reviews aims to rank the set of documents retrieved by complex Boolean queries. Prioritising the most important documents ensures that subsequent review steps can be carried…

Natural Language Queries

MeSH Suggester: A Library and System for MeSH Term Suggestion for Systematic Review Boolean Query Construction

2022-12-18 · Shuai Wang, Hang Li, Guido Zuccon

Boolean query construction is often critical for medical systematic review literature search. To create an effective Boolean query, systematic review researchers typically spend weeks coming up with effective query terms…

Easy and hard functions for the Boolean hidden shift problem

2013-04-16 · Andrew M. Childs, Robin Kothari, Maris Ozols, Martin Roetteler

We study the quantum query complexity of the Boolean hidden shift problem. Given oracle access to f(x+s) for a known Boolean function f, the task is to determine the n-bit string s. The quantum query complexity of this p…