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
Parents
62
Rodrigo Nogueira, Kyunghyun Cho · arXiv (Cornell University) · 2019 · 346 citations · Full text
Susan Dumais, Michele Banko, Eric Brill et al. · 2002 · 289 citations
Positional language models for information retrieval
Yuanhua Lv, ChengXiang Zhai · 2009 · 230 citations
1–5 of 62
197
6
h-index
5
h-index
3
h-index
3
h-index
2
h-index
1–5 of 197
51
Technion – Israel Institute of Technology
Haifa, Israel
3 h-index
4 publications
76 citations

Renmin University of China
Beijing, China
3 h-index
8 publications
815 citations

University of Massachusetts Amherst
Amherst Center, United States
3 h-index
5 publications
150 citations

University of Amsterdam
Amsterdam, The Netherlands
3 h-index
5 publications
77 citations
Baidu (China)
Beijing, China
3 h-index
14 publications
2.6K citations
Microsoft (United States)
Redmond, United States
2 h-index
8 publications
1.5K citations
Microsoft Research (United Kingdom)
Cambridge, United Kingdom
2 h-index
5 publications
164 citations
University of Sheffield
Sheffield, United Kingdom
2 h-index
5 publications
72 citations
1–8 of 51
Repository · 8 publications · 814 citations
8
h-index
Conference · 4 publications · 73 citations
4
h-index
2 publications · 144 citations
2
h-index
Repository · 2 publications · 26 citations
2
h-index
2 publications · 38 citations
2
h-index
1–5