Query word deletion prediction

Web search query logs contain traces of users’ search modifications. One strategy users employ is deleting terms, presumably to obtain greater coverage. It is useful to model and automate term deletion when arbitrary searches are conjunctively matched against a small hand-constructed collection, such as a hand-built hierarchy, or collection of high-quality pages matched with key phrases. Queries with no matches can have words deleted till a match is obtained. We provide algorithms which perform substantially better than the baseline in predicting which word should be deleted from a reformulated query, for increasing query coverage in the context of web search on small high-quality collections. Categories and Subject Descriptors H.3.3 [Information Storage and Retrieval]: Information Search and Retrieval—Query formulation General Terms Experimentation Keywords Web search, query reformulation, query modeling

• Type: Conference
• Year: 2003
• Where: SIGIR
• Authors: Rosie Jones, Daniel C. Fain
• Keywords: Query Coverage, SIGIR 2003, Web Search, Web Search Query