Query Resolution for Conversational Search with Limited Supervision
Nikos Voskarides, Dan Li, Pengjie Ren, Evangelos Kanoulas, Maarten de, Rijke

TL;DR
This paper introduces QuReTeC, a neural model for query resolution in conversational search that uses limited supervision and improves multi-turn passage retrieval by effectively incorporating conversational context.
Contribution
The paper presents a novel neural query resolution model and a distant supervision method that reduces the need for human-labeled data in conversational search tasks.
Findings
QuReTeC outperforms existing models in query resolution accuracy.
Distant supervision effectively reduces reliance on human annotations.
Incorporating QuReTeC improves retrieval performance on TREC CAsT dataset.
Abstract
In this work we focus on multi-turn passage retrieval as a crucial component of conversational search. One of the key challenges in multi-turn passage retrieval comes from the fact that the current turn query is often underspecified due to zero anaphora, topic change, or topic return. Context from the conversational history can be used to arrive at a better expression of the current turn query, defined as the task of query resolution. In this paper, we model the query resolution task as a binary term classification problem: for each term appearing in the previous turns of the conversation decide whether to add it to the current turn query or not. We propose QuReTeC (Query Resolution by Term Classification), a neural query resolution model based on bidirectional transformers. We propose a distant supervision method to automatically generate training data by using query-passage relevance…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Code & Models
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
