Skip to content

Suggesting Queries Based on Word Similarity and Query Modification Patterns

License

Notifications You must be signed in to change notification settings

cache117/cs453-suggesting-similar-queries

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 

History

24 Commits
 
 
 
 
 
 
 
 
 
 
 
 
 
 

Repository files navigation

Project 2 - Suggesting Queries Based on Word Similarity and Query Modification Patterns

This is an implementation of the query-suggestion approach, WebQS, presented in the paper, "Assisting Web Search Using Query Suggestion Based on Word Similarity Measure and Query Modification Patterns," published in the Journal of World Wide Web, Volume 17, Number 5, 2014.

Description

WebQS provides a guide to the users for formulating/completing a keyword query Q using suggested keywords (extracted from the AOL query logs) as potential keywords in Q. The query-suggestion approach considers initial and modified queries in the AOL query logs, along with word-similarity measures, in making query suggestions. WebQS facilitates the formulation of queries in a trie data structure and determines the rankings of suggested keyword queries using distinguished features exhibited in the raw data in the AOL query logs.

The AOL Query Logs

WebQS relies on the AOL query logs to suggest queries. The logs of AOL, which include 50 million queries that were created by millions of AOL users over a three-month period between March 1, 2006 and May 31, 2006. These logs can be found in the resource directory. An AOL query log includes a number of query sessions, each of which captures a period of sustained user activities on the search engine. Each AOL session differs in length and includes a

  • User ID,
    • A user ID, which is an anonymous identifier of its user who performs the search, determines the boundary of each session (as each user ID is associated with a distinct session).
  • The query text,
    • Query text are keywords in a user query and multiple queries may be created under the same session.
  • Date and time of search,
    • The date and time of a search can be used to determine whether two or more queries were created by the same user within 10 minutes, which is the time period that dictates whether two queries should be treated as related.
  • Optionally clicked documents.
    • Clicked documents are retrieved documents that the user has clicked on and are ranked by the search engine.

Queries and documents include stopwords, which are commonly-occurring keywords, such as prepositions, articles, and pronouns, that carry little meaning and often do not represent the content of a document. Stopwords are not considered by WebQS during the query creation process. This project implements WebQS by parsing the AOL query logs to extract query keywords while at the same time retains the information of related keywords in the same session, which were submitted by the same user within 10 minutes in the same session, as discussed earlier.

The Trie Data Structure

Using the extracted keywords, WebQS constructs a trie T in which each node is labeled by a letter in an extracted keyword in the given order, and each node in T is categorized as either "complete" or "incomplete." A complete node is the last node of a path inT representing an (a sequence of, respectively) extracted query keyword (keywords, respectively). If node c is a complete node, then Tc (the subtree of T rooted at a child node of c) contains other suggested keyword(s) represented by the nodes in the path(s) leading from, and excluding, c. The possible number of suggestions of a (sequence of) keyword(s) K rooted at Tc is n, where n is the number of complete nodes in subtrees rooted at Tc, and K is the (sequence of) keyword(s) extracted from the root of Tc. An incomplete node is the last node of a path P in T such that P does not yield a (sequence of) word(s). If c is an incomplete node, then all subsequent nodes of c up till the first complete node are potential suggestions of keywords represented by the nodes in the path leading from, and including, c.

WebQS retains the keywords in query texts in a trie data structure using queries in the AOL query logs. Using the trie, candidate keywords suggested for a query can be found and ranked dynamically. To suggest potential query keywords, WebQS locates a trie branch b up till the (letters in the) keywords that have been entered during the query creation process and extracts the subtrees rooted at the child nodes of the last node of b. The extracted suggestions are ranked using a set of features.

WebQS ranks suggested query keywords in its trie data structure based on

  • The frequency of occurrence (freq) of the keywords in the AOL query logs,
  • Their similarity with the keywords submitted by a user based on the word-correlation factors (WCF s)
  • The number of times the keywords in user queries were modified (Mod) to the keywords in the suggested queries within 10 minutes as shown in the query logs.

This project will show the top eight query suggestions to the user.

About

Suggesting Queries Based on Word Similarity and Query Modification Patterns

Topics

Resources

License

Stars

Watchers

Forks

Releases

No releases published

Packages

No packages published

Languages