Proceedings of the 43rd International ACM SIGIR Conference on Research and Development in Information Retrieval 2020
DOI: 10.1145/3397271.3401130
|View full text |Cite
|
Sign up to set email alerts
|

Query Resolution for Conversational Search with Limited Supervision

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 classific… Show more

Help me understand this report
View preprint versions

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
43
0

Year Published

2020
2020
2023
2023

Publication Types

Select...
4
3

Relationship

1
6

Authors

Journals

citations
Cited by 79 publications
(43 citation statements)
references
References 44 publications
0
43
0
Order By: Relevance
“…Machine learning based query expansion methods tackle CQU of Equation 3.9 by defining a binary term classification problem: for each term appearing in dialog history 𝑞 ∈ H 𝑖 , decide whether to add it to the current query 𝑄 𝑖 . That is, S * consists of all the terms selected by a binary term classifier learned from training data [e.g., Voskarides et al, 2020;Cao et al, 2008;Xiong and Callan, 2015].…”
Section: Machine Learning Based Query Expansion Methodsmentioning
confidence: 99%
See 2 more Smart Citations
“…Machine learning based query expansion methods tackle CQU of Equation 3.9 by defining a binary term classification problem: for each term appearing in dialog history 𝑞 ∈ H 𝑖 , decide whether to add it to the current query 𝑄 𝑖 . That is, S * consists of all the terms selected by a binary term classifier learned from training data [e.g., Voskarides et al, 2020;Cao et al, 2008;Xiong and Callan, 2015].…”
Section: Machine Learning Based Query Expansion Methodsmentioning
confidence: 99%
“…If the component augments the query before retrieval, then it can be evaluated using the retrieval-based evaluation in the previous section. Using TREC CAsT data, several studies employed methods that combine the current query with previous queries, with the goal that the augmented query will yield improved search results [Yang et al, 2019;Vakulenko et al, 2021;Voskarides et al, 2020]. These methods for query expansion and query rewriting are described in more detail in Chapter 3, along with other methods that use recognition and resolution to better process the text of the query and the candidate answers.…”
Section: Evaluating Non-retrieval Componentsmentioning
confidence: 99%
See 1 more Smart Citation
“…The current speech recognition technique was hard to satisfy users’ need (Guy, 2018). Different classifiers for voice queries were proposed to understand user intent accurately (Mukherjee et al, 2013; Qu et al, 2019; Voskarides, 2020). And playing with a voice assistant without a body and figure was perceived as a less entertainment experience comparing with a robot (Pollmann et al, 2020).…”
Section: Literature Reviewmentioning
confidence: 99%
“…We fine-tune a pre-trained BERT model [49] on the relevance classification datasets of the TREC Web 2009, 2010 and 2011 tracks [29,30,150], and then take each query-document pair as the input and output vector as it semantic representation. Fine-tuning a pre-trained BERT model on downstream tasks like relevance classification have been widely proven effective [164]. The three web tracks are used as the fine-tuning dataset because they share the same ClueWeb09 document collection with the crowdsourcing datasets in our experiments in Section 4.5.…”
Section: Task Representationmentioning
confidence: 99%