Sparse Passage Retrieval
Sparse Passage Retrieval is a lexical matching approach to passage retrieval that relies on sparse representations of queries and passages, typically using term frequency-based weighting schemes such as TF-IDF or BM25, to identify relevant passages by computing similarity over explicitly weighted keyword overlaps.
9
Publications
737
Citations
39
Authors
13
Institutions
Publications per year
2017–2026
9
Parents
9
Dense Passage Retrieval for Open-Domain Question Answering
Vladimir Karpukhin, Barlas Oğuz, Sewon Min et al. · 2020 · 142 citations · Full text
1–5 of 9
39
2
h-index
2
h-index
2
h-index
2
h-index
2
h-index
1–5 of 39
13
Amazon (United States)
Seattle, United States
1 h-index
1 publications
14 citations

University of Waterloo
Waterloo, Canada
1 h-index
3 publications
177 citations
Princeton University
Princeton, United States
1 h-index
1 publications
142 citations
University of Washington
Seattle, United States
1 h-index
1 publications
142 citations

University of Wollongong
Wollongong, Australia
1 h-index
1 publications
14 citations
Meta (Israel)
Tel Aviv, Israel
1 h-index
5 publications
710 citations

University of Massachusetts Amherst
Amherst Center, United States
1 h-index
5 publications
100 citations
Amazon (United Kingdom)
London, United Kingdom
1 h-index
1 publications
14 citations
1–8 of 13
Repository · 3 publications · 155 citations
3
h-index
1 publications · 13 citations
1
h-index
1 publications · 14 citations
1
h-index
1–3