Granted Patent B2

US 9,507,855 · App. 14/146,723 · Granted Nov 29, 2016

Abstract

Claims (35)

1. A method for searching indexed content data using multiple proximity keyword searches, the method utilizing a computer system including a computer processor and at least one or more memories with stored data in electronic form relating to a collection documents, the method comprising the steps of:

identifying, by a user of a computer system, a plurality of keywords relevant to a desired issue to research; and

utilizing the computer processor to:

create a first query to search a collection of structured documents, the first query configured as a Boolean query comprising a first keyword chosen from the plurality of keywords, and additional forms of the first keyword, and a first proximity value from 1 to 60;

execute the first query and receive a first result set of documents and a first set of nouns and verbs in the collection of structured documents within the first proximity value of the first query's first keyword and additional forms of the first keyword;

create a first narrowed set of documents by removing any document not responsive to the first query;

create a second query to search the first narrowed set of documents, the second query configured as a Boolean query comprising (i) a second keyword chosen from the plurality of keywords and additional forms of the second keyword, (ii) the first set of nouns and verbs in the collection of structured documents within the first proximity value of the first query's first keyword and additional forms of the first keyword, and (iii) a second proximity value from 1 to 60;

execute the second query and receive a second result set of documents and a second set of nouns and verbs in the collection of structured documents within the second proximity value of the second query's second keyword and additional forms of the second keyword and the first set of nouns and verbs;

create a second narrowed set of documents by removing any document not responsive to the second query;

repeat creation and execution of additional queries for each keyword, K, in the plurality of keywords, wherein the additional queries are in the form of:

a K query to search the K−1 narrowed set of documents, the K query configured as a Boolean query comprising (i) a K keyword chosen from the plurality of keywords and additional forms of the K keyword, (ii) all nouns and verbs in the collection of structured documents returned from previously executed queries, and (iii) a K proximity value from 1 to 60;

create a filtered word list comprising all nouns and verbs in the collection of structured documents returned from all previously executed queries;

create a filtered word list query to search the collection of structured documents comprising every Boolean combination of the filtered word list and its synonyms; and

execute the filtered word list query and receive a filtered word list set of documents.

2. The method of claim 1 , wherein the number of keywords is three.

3. The method of claim 1 , wherein at least one of the first, second, or K proximity values is 50.

4. The method of claim 1 , further comprising tagging documents in the filtered word list set of documents with appropriate issue codes.

5. A system for using multiple proximity keyword searches in a search query comprising:

a processor coupled to a bus; and

a memory coupled to the bus comprising computer executable instructions that when executed by the processor:

identify, with input from a user of the system, a plurality of keywords relevant to a desired issue to research;

create a first query to search a collection of structured documents, the first query configured as a Boolean query comprising a first keyword chosen from the plurality of keywords and additional forms of the first keyword, and a first proximity value from 1 to 60;

execute the first query and receive a first result set of documents and a first set of nouns and verbs in the collection of structured documents within the first proximity value of the first query's first keyword and additional forms of the first keyword;

create a first narrowed set of documents by removing any document not responsive to the first query;

create a second query to search the first narrowed set of documents, the second query configured as a Boolean query comprising (i) a second keyword chosen from the plurality of keywords and additional forms of the second keyword, (ii) the first set of nouns and verbs in the collection of structured documents within the first proximity value of the first query's first keyword and additional forms of the first keyword and (iii) a second proximity value from 1 to 60;

execute the second query and receive a second result set of documents and a second set of nouns and verbs in the collection of structured documents within the second proximity value of the second query's second keyword and additional forms of the second keyword and the first set of nouns and verbs;

create a second narrowed set of documents by removing any document not responsive to the second query;

repeat creation and execution of additional queries for each keyword, K, in the plurality of keywords, wherein the additional queries are in the form of:

a K query to search the K−1 narrowed set of documents, the K query configured as a Boolean query comprising (i) a K keyword chosen from the plurality of keywords and additional forms of the K keyword, (ii) all nouns and verbs in the collection of structured documents returned from previously executed queries, and (iii) a K proximity value from 1 to 60;

create a filtered word list comprising all nouns and verbs in the collection of structured documents returned from all previously executed queries;

create a filtered word list query to search the collection of structured documents comprising every Boolean combination of the filtered word list and its synonyms; and

execute the filtered word list query and receive a filtered word list set of documents.

6. The system of claim 5 , wherein the number of keywords is three.

7. The system of claim 5 , wherein at least one of the first, second, or K proximity values is 50.

8. The system of claim 5 , further comprising the instruction: tag documents in the filtered word list set of documents with appropriate issue codes.

Assignments (14)