Back to results
US 9,519,703 B2Granted
Refining search results for a compound search query
AssigneeInternational Business Machines Corporation
InventorsSaurabh Agarwal, Dhanashree Srivastava
Life of this patent
Estimating the term…
Abstract
A method for refining search results. The method includes receiving a search query and in response to determining the search query is a compound search query, the method includes parsing the compound search query into at least two sub-queries. The method includes performing a search for each of the sub-queries and receiving a set of results from each search. The method then includes receiving a selection of a received result from one of the results sets and performing a second search using the selected received result and a sub-query not associated with the selected received result.
Claims12
A computer-implemented method for refining search results, the method comprising the actions of:
- receiving, by one or more computer processors, a search query;
- determining, by one or more computer processors, whether the search query is a compound search query, wherein a compound search query includes at least two search queries separated by at least one logical operator;
- in response to determining the search query is a compound search query, parsing, by one or more computer processors, the compound search query into at least a first sub-query and a second sub-query;
- performing, by one or more computer processors, a search for each of the sub-queries and the compound search query;
- receiving, by one or more computer processors, a set of results from each search;
- determining, by one or more computer processors, a selection is made of a received result from the search of the first sub-query;
- creating, by one or more computer processors, a new search query that includes text from the selected received result and the second sub-query;
- performing, by one or more computer processors, a second search using the selected received result and the second sub-query;
- and
- determining, by one or more computer processors, a ranked order for each set of received results, wherein the ranked order is determined based on a weight assigned to each search result obtained, wherein the weight is determined based on a preference of a user, the preference being set prior to entering the search query and including a preference for social media data, geographic location data, and a preference based on a prior history of the user's searches, and one or more of:
- a relevancy to the search query, and a timeliness of the received result.
8 more elements
A computer program product for refining search results, the computer program product comprising:
- one or more computer-readable tangible storage device and program instructions stored on the one or more computer-readable tangible storage device, wherein the computer-readable tangible storage device is not a transitory signal per se, the program instructions comprising:
- program instructions to receive a search query;
- program instructions to determine whether the search query is a compound query, wherein a compound query includes at least two search queries separated by at least one logical operator;
- in response to determining the search query is a compound search query, program instructions to parse the compound search query into at least a first sub-query and a second sub-query;
- program instructions to perform a search for each of the sub-queries and the compound search query;
- program instructions to receive a set of results from each search;
- program instructions to determine a selection is made of a received result from the search of the first sub-query;
- program instructions to create a new search query that includes text from the selected received result and the second sub-query;
- program instructions to perform a second search using the selected received result and the second sub-query;
- and
- determining a ranked order for each set of received results, wherein the ranked order is determined based on a weight assigned to each search result obtained, wherein the weight is determined based on a preference of a user, the preference being set prior to entering the search query and including a preference for social media data, geographic location data, and a preference based on a prior history of the user's searches, and one or more of:
- a relevancy to the search query, and a timeliness of the received result.
9 more elements
A computer system for refining search results, the computer system comprising:
- one or more computer processors;
- one or more computer-readable tangible storage media;
- program instructions stored on the one or more computer-readable tangible storage media for execution by at least one of the one or more computer processors, the program instructions comprising:
- program instructions to receive a search query;
- program instructions to determine whether the search query is a compound query, wherein a compound query includes at least two search queries separated by at least one logical operator;
- in response to determining the search query is a compound search query, program instructions to parse the compound search query into at least a first sub-query and a second sub-query;
- program instructions to perform a search for each of the sub-queries and the compound search query;
- program instructions to receive a set of results from each search;
- program instructions to determine a selection is made of a received result from the search of the first sub-query;
- program instructions to create a new search query that includes text from the selected received result and the second sub-query;
- program instructions to perform a second search using the selected received result and the second sub-query;
- and
- determining a ranked order for each set of received results, wherein the ranked order is determined based on a weight assigned to each search result obtained, wherein the weight is determined based on a preference of a user, the preference being set prior to entering the search query and including a preference for social media data, geographic location data, and a preference based on a prior history of the user's searches, and one or more of:
- a relevancy to the search query, and a timeliness of the received result.
11 more elements
Dependencies are inferred from the claim text.