Query-passage Matching

Query-Passage Matching is a computational process in information retrieval that, as a core component of passage retrieval, involves determining the relevance or semantic alignment between a natural language query and a candidate passage by jointly encoding and comparing their representations to identify the most contextually pertinent segments.

62

Publications

4K

Citations

197

Authors

51

Institutions

Publications per year

2017–2026

23

Authors

197

  1. CL
    Charles L. A. Clarke

    University of Waterloo, Canada

    6 publications · 196 citations

    6

    h-index

  2. GV
    Gordon V. Cormack

    University of Waterloo, Canada

    5 publications · 156 citations

    5

    h-index

  3. JC
    Jamie Callan

    Carnegie Mellon University, United States

    3 publications · 261 citations

    3

    h-index

  4. OK
    Oren Kurland

    Technion – Israel Institute of Technology, Israel

    3 publications · 65 citations

    3

    h-index

  5. ZD
    Zhuyun Dai

    Carnegie Mellon University, United States

    2 publications · 249 citations

    2

    h-index

1–5 of 197

Venues

  1. arXiv (Cornell University)

    Repository · 8 publications · 814 citations

    8

    h-index

  2. Text REtrieval Conference

    Conference · 4 publications · 73 citations

    4

    h-index

  3. Information Processing & Management

    2 publications · 144 citations

    2

    h-index

  4. 2

    h-index

  5. Information Retrieval

    2 publications · 38 citations

    2

    h-index

1–5