SEARCH PHRASE REFINEMENT BY SEARCH TERM REPLACEMENT
First Claim
1. A computer-implemented method comprising:
- receiving a plurality of first search queries, each of which comprises one or more first query terms;
constructing at least one association graph that includes at least a portion of the first query terms as vertices;
receiving from a user a second search query comprising a plurality of second query terms;
using the at least one association graph, identifying one or more suggested replacement terms for one or more of the second query terms;
presenting the suggested replacement terms to the user;
responsively to a selection of one of the suggested replacement terms by the user, substituting the selected suggested replacement term for the corresponding one of the second query terms, to generate a refined search query; and
presenting search results to the user responsively to the refined search query.
2 Assignments
0 Petitions
Accused Products
Abstract
A computer-implemented method is provided, which includes receiving a plurality of first search queries, each of which comprises one or more first query terms. At least one association graph is constructed that includes at least a portion of the first query terms as vertices. A second search query is received from a user, which comprises a plurality of second query terms. One or more suggested replacement terms for one or more of the second query terms are identified, using the at least one association graph. The suggested replacement terms are presented to the user. Responsively to a selection of one of the suggested replacement terms by the user, the selected suggested replacement term is substituted for the corresponding one of the second query terms, to generate a refined search query. Search results are presented to the user responsively to the refined search query. Other embodiments are also described.
254 Citations
60 Claims
-
1. A computer-implemented method comprising:
-
receiving a plurality of first search queries, each of which comprises one or more first query terms; constructing at least one association graph that includes at least a portion of the first query terms as vertices; receiving from a user a second search query comprising a plurality of second query terms; using the at least one association graph, identifying one or more suggested replacement terms for one or more of the second query terms; presenting the suggested replacement terms to the user; responsively to a selection of one of the suggested replacement terms by the user, substituting the selected suggested replacement term for the corresponding one of the second query terms, to generate a refined search query; and presenting search results to the user responsively to the refined search query. - View Dependent Claims (2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 17, 18, 19)
-
-
15. -16. (canceled)
-
20. A computer-implement method comprising:
-
receiving from a user an initial search query comprising a plurality of query terms; designating one or more of the query terms as anchor terms, and the remaining query terms as non-anchor terms; identifying one or more suggested replacement terms for one or more of the non-anchor terms and not for any of the anchor terms; presenting the suggested replacement terms to the user; responsively to a selection of one of the suggested replacement terms by the user, substituting the selected suggested replacement term the corresponding one of the query terms, to generate a refined search query; and presenting search results to the user responsively to the refined search query. - View Dependent Claims (21, 22, 26, 27, 28)
-
-
23. -25. (canceled)
-
29. (canceled)
-
30. Apparatus comprising:
-
an interface; and a processor, which is configured to receive a plurality of first search queries, via the interface, each of which comprises one or more first query terms;
construct at least one association graph that includes at least a portion of the first query terms as vertices;
receive from a user, via the interface, a second search query comprising a plurality of second query terms;
using the at least one association graph, identify one or more suggested replacement terms for one or more of the second query terms;
present the suggested replacement terms to the user, via the interface;
responsively to a selection of one of the suggested replacement terms by the user, substitute the selected suggested replacement term for the corresponding one of the second query terms, to generate a refined search query; and
present, via the interface, search results to the user responsively to the refined search query.
-
-
31. -58. (canceled)
-
59. A computer software product, comprising a tangible computer-readable medium in which program instructions are stored, which instructions, when read by a computer, cause the computer to receive a plurality of first search queries, each of which comprises one or more first query terms;
- construct at least one association graph that includes at least a portion of the first query terms as vertices;
receive from a user a second search query comprising a plurality of second query terms;
using the at least one association graph, identify one or more suggested replacement terms for one or more of the second query terms;
present the suggested replacement terms to the user;
responsively to a selection of one of the suggested replacement terms by the user, substitute the selected suggested replacement term for the corresponding one of the second query terms, to generate a refined search query; and
present search results to the user responsively to the refined search query.
- construct at least one association graph that includes at least a portion of the first query terms as vertices;
-
60. -87. (canceled)
Specification