SYSTEMS AND METHODS FOR IMPROVED WEB SEARCHING
7 Assignments
0 Petitions
Accused Products
Abstract
Systems and methods are provided for improved web searching. In one implementation, suggested search queries are provided based on previous search queries and click data. A weighted bi-partite graph or index may be used to identify related search queries based on overlapping clicked URLs. According to a method, query-click log data of a search engine is processed to generate sets of suggested search queries, data corresponding to each suggested search query, and a set of clicked URLs related to each suggested search query. Additionally, or independently, methods may be provided for contextually correcting spelling errors within sets of suggested search queries using a contextual algorithm, and/or identifying and discarding sets of suggested search queries and URLs that lead to restricted material, such as restricted content and related URLs.
-
Citations
52 Claims
-
1-32. -32. (canceled)
-
33. A computer-implemented method, comprising:
-
storing, in a memory device, a clustered set of search queries; obtaining information identifying unique tokens or bi-grams within the clustered set of search queries; determining, using at least one processor, that a least-frequent token or bi-gram of the identified tokens or bi-grams is misspelled when an edit distance for the least-frequent token or bi-gram falls below a threshold value; and identifying, using the at least one processor, a most-frequent permutation of the misspelled token or bi-gram within the identified tokens or bi-grams as a corrected spelling for the misspelled token or bigram. - View Dependent Claims (34, 35, 36, 37, 38, 39, 40, 41, 42)
-
-
43. An apparatus, comprising:
-
a storage device that stores a set of instructions; and at least one processor coupled to the storage device, the at least one processor being operative with the set of instructions in order to; obtain information identifying unique tokens or bi-grams within a clustered set of search queries; determine that a least-frequent token or bi-gram of the identified tokens or bi-grams is misspelled when an edit distance for the least-frequent token or bi-gram falls below a threshold value; and identify a most-frequent permutation of the misspelled token or bi-gram within the identified tokens or bi-grams as a corrected spelling for the misspelled token or bigram - View Dependent Claims (44, 45, 46, 47, 48, 49, 50, 51)
-
-
52. A tangible, non-transitory computer-readable medium storing instructions that, when executed by at least one processor, cause the at least one processor to perform a method comprising:
-
storing, in a memory device, a clustered set of search queries; obtaining information identifying unique tokens or bi-grams within the clustered set of search queries; determining a least-frequent token or bi-gram of the identified tokens or bi-grams is misspelled when an edit distance for the least-frequent token or bi-gram falls below a threshold value; and identifying a most-frequent permutation of the misspelled token or bi-gram within the identified tokens or bi-grams as a corrected spelling for the misspelled token or bigram.
-
Specification