# US 9,519,703 B2 · Refining search results for a compound search query

> Agents: this data is available as JSON from the patentgrep API and MCP server — see https://patentgrep.com/llms.txt

- Number: US 9,519,703 B2
- Document ID: US9519703B2
- Status: Granted
- Kind: B2
- Application number: 13/847,618
- Filed: 2013-03-20
- Published: 2014-09-25
- Granted: 2016-12-13
- Earliest claimed: 2013-03-20
- Assignees: International Business Machines Corporation
- Applicants: International Business Machines Corporation
- Inventors: Saurabh Agarwal; Dhanashree Srivastava
- Web page: https://patentgrep.com/patent/US9519703B2

## CPC

- G06F 16/3334: {Selection or weighting of terms from queries, including natural language queries}
- G06F: ELECTRIC DIGITAL DATA PROCESSING (computer systems based on specific computational models G06N)

## 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.

## Claims

### Claim 1

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.

### Claim 2 (depends on 1)

The method of claim 1, further comprising:
displaying, separately from any other search results, the set of results from the search of the compound search query.

### Claim 3 (depends on 2)

The method of claim 2, further comprising:
displaying the set of results received from performing the search using the compound search query in a browser tab; and
displaying each set of results received from performing the search for each sub-query in separate browser tabs.

### Claim 4 (depends on 1)

The method of claim 1, wherein the compound search query includes natural language plain text entered by a user.

### Claim 5

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.

### Claim 6 (depends on 5)

The computer program product of claim 5, further comprising:
program instructions to display, separately from any other search results, the set of results from the search of the compound search query.

### Claim 7 (depends on 6)

The computer program product of claim 6, further comprising:
program instructions to display the set of results received from performing the search using the compound search query in a browser tab; and
program instructions to display each set of results received from performing the search for each sub-query in separate browser tabs.

### Claim 8 (depends on 5)

The computer program product of claim 5, wherein the compound search query includes natural language plain text entered by a user.

### Claim 9

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.

### Claim 10 (depends on 9)

The computer system of claim 9, further comprising:
program instructions to display, separately from any other search results, the set of results from the search of the compound search query.

### Claim 11 (depends on 10)

The computer system of claim 10, further comprising:
program instructions to display the set of results received from performing the search using the compound search query in a browser tab; and
program instructions to display each set of results received from performing the search for each sub-query in separate browser tabs.

### Claim 12 (depends on 9)

The computer system of claim 9, wherein the compound search query includes natural language plain text entered by a user.