Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 218,007,860 papers from all fields of science
Search
Sign In
Create Free Account
Query expansion
Known as:
Automatic query reformulation
, QE
Query expansion (QE) is the process of reformulating a seed query to improve retrieval performance in information retrieval operations.In the context…
Expand
Wikipedia
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
15 relations
Computer science
Document retrieval
Google Search
Human–computer information retrieval
Expand
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2016
Highly Cited
2016
Query Expansion with Locally-Trained Word Embeddings
Fernando Diaz
,
Bhaskar Mitra
,
Nick Craswell
Annual Meeting of the Association for…
2016
Corpus ID: 5740960
Continuous space word embeddings have received a great deal of attention in the natural language processing and machine learning…
Expand
Highly Cited
2016
Highly Cited
2016
Query Expansion Using Word Embeddings
Saar Kuzi
,
Anna Shtok
,
Oren Kurland
International Conference on Information and…
2016
Corpus ID: 207242638
We present a suite of query expansion methods that are based on word embeddings. Using Word2Vec's CBOW embedding approach…
Expand
Highly Cited
2015
Highly Cited
2015
Query expansion via WordNet for effective code search
Meili Lu
,
Xiaobing Sun
,
Shaowei Wang
,
D. Lo
,
Yucong Duan
IEEE International Conference on Software…
2015
Corpus ID: 10991311
Source code search plays an important role in software maintenance. The effectiveness of source code search not only relies on…
Expand
Highly Cited
2014
Highly Cited
2014
Entity query feature expansion using knowledge base links
Jeffrey Dalton
,
Laura Dietz
,
James Allan
Annual International ACM SIGIR Conference on…
2014
Corpus ID: 12620927
Recent advances in automatic entity linking and knowledge base construction have resulted in entity annotations for document and…
Expand
Highly Cited
2009
Highly Cited
2009
Logo retrieval with a contrario visual query expansion
A. Joly
,
Olivier Buisson
ACM Multimedia
2009
Corpus ID: 17048183
This paper presents a new content-based retrieval framework applied to logo retrieval in large natural image collections. The…
Expand
Highly Cited
2007
Highly Cited
2007
Total Recall: Automatic Query Expansion with a Generative Feature Model for Object Retrieval
Ondřej Chum
,
James Philbin
,
Josef Sivic
,
M. Isard
,
Andrew Zisserman
IEEE International Conference on Computer Vision
2007
Corpus ID: 570516
Given a query image of an object, our objective is to retrieve all instances of that object in a large (1M+) image database. We…
Expand
Highly Cited
2007
Highly Cited
2007
Statistical Machine Translation for Query Expansion in Answer Retrieval
S. Riezler
,
A. Vasserman
,
Ioannis Tsochantaridis
,
Vibhu Mittal
,
Yi Liu
Annual Meeting of the Association for…
2007
Corpus ID: 2713391
We present an approach to query expansion in answer retrieval that uses Statistical Machine Translation (SMT) techniques to…
Expand
Highly Cited
2006
Highly Cited
2006
Generating query substitutions
R. Jones
,
Benjamin Rey
,
Omid Madani
,
W. Greiner
The Web Conference
2006
Corpus ID: 207159138
We introduce the notion of query substitution, that is, generating a new query to replace a user's original search query. Our…
Expand
Highly Cited
1998
Highly Cited
1998
Improving automatic query expansion
Mandar Mitra
,
A. Singhal
,
C. Buckley
Annual International ACM SIGIR Conference on…
1998
Corpus ID: 5991216
Most casual users of IR systems type short queries. Recent research has shown that adding new words to these queries via odhoc…
Expand
Highly Cited
1993
Highly Cited
1993
Concept based query expansion
Yonggang Qiu
,
H. Frei
Annual International ACM SIGIR Conference on…
1993
Corpus ID: 11711278
Query expansion methods have been studied for a long time - with debatable success in many instances. In this paper we present a…
Expand
By clicking accept or continuing to use the site, you agree to the terms outlined in our
Privacy Policy
(opens in a new tab)
,
Terms of Service
(opens in a new tab)
, and
Dataset License
(opens in a new tab)
ACCEPT & CONTINUE