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

Authors

39

  1. YQ
    Yingqi Qu

    Baidu (China), China

    2 publications · 407 citations

    2

    h-index

  2. DD
    Daxiang Dong

    Baidu (China), China

    2 publications · 407 citations

    2

    h-index

  3. WX
    Wayne Xin Zhao

    Renmin University of China, China

    2 publications · 407 citations

    2

    h-index

  4. YD
    Yuchen Ding

    Renmin University of China, China

    2 publications · 407 citations

    2

    h-index

  5. RR
    Ruiyang Ren

    Renmin University of China, China

    2 publications · 407 citations

    2

    h-index

1–5 of 39

Venues

  1. arXiv (Cornell University)

    Repository · 3 publications · 155 citations

    3

    h-index

  2. Information Processing & Management

    1 publications · 13 citations

    1

    h-index

  3. ACM Transactions on Information Systems

    1 publications · 14 citations

    1

    h-index

1–3