METHOD AND DEVICE FOR SEARCHING CHARACTER STRING
First Claim
Patent Images
1. A method of searching a character string, comprising:
- determining a plurality of sets of documents at least in part by, for each token in the character string, determining a set of documents including the token;
sorting the sets of documents in the plurality of sets of documents according to the number of documents included in each set of documents;
responsive to the sorting of the sets of documents, selecting a first set of documents including a first token in the character string, and a second set of documents including a second token in the character string, wherein the first set of documents and the second set of documents have the least numbers of documents in the plurality of sets of documents; and
generating a third set of documents based on the first and second sets of documents, wherein for each document in the third set of documents;
i) the document is included in both the first set of documents and the second set of documents, andii) a distance between the first token and the second token in the document is equal to a distance between the first token and the second token in the character string.
8 Assignments
0 Petitions
Accused Products
Abstract
Techniques for searching a character string involve: determining a first set of documents including a first token in the character string, and a second set of documents including a second token in the character string; and generating a third set of documents based on the first and second sets of documents, in the third set of documents: i) a document being included in the first and second sets of documents, and ii) a distance between the first and second tokens in the document being equal to a distance between the first and second tokens in the character string.
0 Citations
20 Claims
-
1. A method of searching a character string, comprising:
-
determining a plurality of sets of documents at least in part by, for each token in the character string, determining a set of documents including the token; sorting the sets of documents in the plurality of sets of documents according to the number of documents included in each set of documents; responsive to the sorting of the sets of documents, selecting a first set of documents including a first token in the character string, and a second set of documents including a second token in the character string, wherein the first set of documents and the second set of documents have the least numbers of documents in the plurality of sets of documents; and generating a third set of documents based on the first and second sets of documents, wherein for each document in the third set of documents; i) the document is included in both the first set of documents and the second set of documents, and ii) a distance between the first token and the second token in the document is equal to a distance between the first token and the second token in the character string. - View Dependent Claims (2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12)
-
-
13. An electronic device comprising:
a processing unit configured to; determine a plurality of sets of documents at least in part by, for each token in the character string, determining a set of documents including the token; sort the sets of documents in the plurality of sets of documents according to the number of documents included in each set of documents; responsive to the sorted sets of documents, select a first set of documents including a first token in the character string, and a second set of documents including a second token in the character string, wherein the first set of documents and the second set of documents have the least numbers of documents in the plurality of sets of documents; and generate a third set of documents based on the first set of documents and the second set of documents, wherein for each document in the third set of documents; i) the document is included in both the first set of documents and the second set of documents, and ii) a distance between the first token and the second token in the document is equal to a distance between the first token and the second token in the character string. - View Dependent Claims (14, 15, 16, 17, 18, 19)
-
20. A computer program product for searching a character string, the computer program product comprising:
a non-transitory computer readable medium encoded with computer-executable code, the code configured to enable the execution of; determining a plurality of sets of documents at least in part by, for each token in the character string, determining a set of documents including the token; sorting the sets of documents in the plurality of sets of documents according to the number of documents in each set of documents; responsive to the sorting of the sets of documents, selecting a first set of documents including a first token in the character string, and a second set of documents including a second token in the character string, wherein the first set of documents and the second set of documents have the least numbers of documents in the plurality of sets of documents; and generating a third set of documents based on the first and second sets of documents, wherein for each document in the third set of documents; i) the document is included in both the first set of documents and the second set of documents, and ii) a distance between the first token and the second token in the document is equal to a distance between the first token and the second token in the character string.
Specification