Systems and methods for improved web searching

Abstract

Systems and methods are provided for improved web searching. In one implementation, suggest 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.

1 - 32 . (canceled) 
     
     
         33 . A computer-implemented method for marking content, the method being performed by one or more processors, and the method comprising:
 receiving a search query, a black list, and a white list;   determining one or more tokens of the search query;   marking the search query based on determining that a match exists between at least one token of the one or more tokens of the search query and at least one item of one or more items of the black list; and   unmarking the search query based on determining that a match exists between at least one token of the one or more tokens of the search query and at least one item of one or more items of the white list.   
     
     
         34 . The method of  claim 33 , wherein the determining that a match exists between at least one token of the one or more tokens of the search query and the at least one item of the one or more items of the black list includes an exact match lookup, and wherein the method further comprises blocking the search query as a result of determining that the at least one token of the one or more tokens of the search query does not exactly match the at least one item of the one or more items of the white list. 
     
     
         35 . The method of  claim 33 , further comprising:
 determining whether additional search query tokens are to be processed when the at least one token of the one or more tokens of the search query does not exactly match the at least one item of the one or more items of the white list.   
     
     
         36 . The method of  claim 33 , further comprising:
 comparing the one or more tokens of the search query against each of a plurality of restricted-content listings in an alternate list; and   marking the one or more tokens of the search query as potentially blocked if the one of the one or more tokens of the search query is determined to match at least one of the plurality of restricted-content listings in the alternate list.   
     
     
         37 . The method of  claim 33 , further comprising:
 identifying a corresponding time stamp of the search query;   determining whether the corresponding time stamp is within a threshold time period; and   upon determining that the corresponding time stamp is not within of the threshold time period, blocking the search query.   
     
     
         38 . The method of  claim 33 , further comprising:
 determining a total number of restricted-content Uniform Resource Locators (URLs) clicked in response to the search query;   determining whether the total number of restricted-content URLs exceeds a threshold value; and   upon determining the total number of restricted content URLs exceeds the threshold value, marking the search query as a restricted content listing.   
     
     
         39 . The method of  claim 33 , further comprising:
 overriding the black list to allow an item included within the black list to be included in the white list.   
     
     
         40 . The method of  claim 33 , further comprising:
 expanding the white list to include listings for search queries and clicked URLs related to at least one of finance or banking.   
     
     
         41 . The method of  claim 33 , wherein the black list includes listings associated with one or more of: a parental control set by an authorization level, a fee or subscription based access level, a geographic area or time zone restriction, and a client device and connection status restriction. 
     
     
         42 . A system for filtering content, the system comprising:
 a storage medium that stores instructions; and   one or more processors configured to execute the instructions to:   receive a search query, a black list, and a white list;   determine one or more tokens of the search query;   mark the search query based on determining that a match exists between at least one token of the one or more tokens of the search query and at least one item of one or more items of the black list; and   unmark the search query based on determining that a match exists between at least one token of the one or more tokens of the search query and at least one item of one or more items of the white list.   
     
     
         43 . The system of  claim 42 , wherein the determining that a match exists between at least one token of the one or more tokens of the search query and the at least one item of the one or more items of the black list includes an exact match lookup, and wherein the system further comprises blocking the search query as a result of determining that the at least one token of the one or more tokens of the search query does not exactly match the at least one item of the one or more items of the white list. 
     
     
         44 . The system of  claim 42 , wherein the one or more processors are further operative with the instructions to determine whether additional search query tokens are to be processed when the at least one token of the one or more tokens of the search query does not exactly match the at least one item of the one or more items of the white list. 
     
     
         45 . The system of  claim 42 , wherein the one or more processors are further operative with the instructions to:
 compare the one or more tokens of the search query against each of a plurality of restricted-content listings in an alternate list; and   mark the one or more tokens of the search query as potentially blocked if the one of the one or more tokens of the search query is determined to match at least one of the plurality of restricted-content listings in the alternate list.   
     
     
         46 . The system of  claim 42 , wherein the one or more processors are further operative with the instructions to:
 identify a corresponding time stamp of the search query;   determine whether the corresponding time stamp is within a threshold time period; and   upon determining that the corresponding time stamp is not within of the threshold time period, block the search query.   
     
     
         47 . The system of  claim 42 , wherein the one or more processors are further operative with the instructions to:
 determine a total number of restricted-content Uniform Resource Locators (URLs) clicked in response to the search query;   determine whether the total number of restricted-content URLs exceeds a threshold value; and   upon determining the total number of restricted content URLs exceeds the threshold value, mark the search query as a restricted content listing.   
     
     
         48 . A tangible, non-transitory computer-readable medium that stores instructions that, when executed by one or more processors, cause the one or more processors to:
 receiving a search query, a black list, and a white list;   determining one or more tokens of the search query;   marking the search query based on determining that a match exists between at least one token of the one or more tokens of the search query and at least one item of one or more items of the black list; and   unmarking the search query based on determining that a match exists between at least one token of the one or more tokens of the search query and at least one item of one or more items of the white list.   
     
     
         49 . The computer-readable medium of  claim 48 , wherein determining that a match exists between at least one token of the one or more tokens of the search query and the at least one item of the one or more items of the black list includes an exact match lookup, and wherein the instructions further comprises blocking the search query as a result of determining that the at least one token of the one or more tokens of the search query does not exactly match the at least one item of the one or more items of the white list. 
     
     
         50 . The computer-readable medium of  claim 48 , wherein the instructions, when executed by the one or more processors, further cause the one or more processors to determine whether additional search query tokens are to be processed when the at least one token of the one or more tokens of the search query does not exactly match the at least one item of the one or more items of the white list. 
     
     
         51 . The computer-readable medium of  claim 48 , wherein the instructions, when executed by the one or more processors, further cause the one or more processors to:
 compare the one or more tokens of the search query against each of a plurality of restricted-content listings in an alternate list; and   mark the one or more tokens of the search query as potentially blocked if the one of the one or more tokens of the search query is determined to match at least one of the plurality of restricted-content listings in the alternate list.   
     
     
         52 . The computer-readable medium of  claim 48 , wherein the instructions, when executed by the one or more processors, further cause the one or more processors to:
 identify a corresponding time stamp of the search query;   determine whether the corresponding time stamp is within a threshold time period; and   upon determining that the corresponding time stamp is not within of the threshold time period, block the search query.