Systems and methods for ranking documents

• US 8,938,466 B2
• Filed: 01/15/2010
• Issued: 01/20/2015
• Est. Priority Date: 01/15/2010
• Status: Active Grant

• Current Assignee: RELX Inc. (RELX PLC)
• Original Assignee: LexisNexis Group Inc. (RELX PLC)
• Inventors: Stiver, Mark C., Koul, Vimal, Miller, Euphemia H., Seitter, Jeff A.
• Primary Examiner(s): PEACH, POLINA G
• Application Number:
  US12/688,365
• Publication Number:
  US 20110179024A1
• Time in Patent Office: 1,831 Days
• US Class Current: 707/766
• CPC Class Codes: G06F 16/24578 using ranking
• CPC Class Codes: G06F 16/334 Query execution G06F16/335 takes precedence
• CPC Class Codes: G06F 16/338 Presentation of query results
• CPC Class Codes: G06F 16/9535 Search customisation based on user profiles and personalisation

Abstract

Systems, methods, and computer-readable media are provided for ranking documents. An exemplary method includes receiving a plurality of queries from a user that are related to a search topic. The queries are compared to a plurality of documents stored in a database to identify candidate documents that match one or more of the queries. The number of matching queries is determined for the candidate documents. The candidate documents are ranked, using a computer processor, for relevance to the search topic based at least on the number of matching queries for each respective candidate document.

Claims

1. A computer-implemented method for ranking documents, comprising:

receiving a first query from a user, the first query being related to a search topic;

comparing the first query to a plurality of documents stored in a database to identify a first set of candidate documents, each of the first set of candidate documents matching the first query;

providing an interface to the user, the interface including references to the first set of candidate documents as well as a query icon representing the first query;

receiving a second query from the user, the second query being related to the search topic;

comparing the second query to a plurality of documents stored in a database to identify a second set of candidate documents, each of the second set of candidate documents matching the second query;

comparing the first and second set of candidate documents from the first query and the second query to identify an updated set of candidate documents, each of the updated set of candidate documents matching one or more of the first and second queries;

determining, for the updated set of candidate documents, a count of matching queries;

ranking, using a computer processor, the updated set of candidate documents for relevance to the search topic based at least on the count of matching queries for each respective candidate document;

providing an updated interface to the user, the updated interface including references to one or more of the ranked candidate documents and the count of matching queries for each respective one or more of the ranked candidate documents as well as a second query icon representing the second query;

updating a graphical user interface element comprising a progress bar which indicates whether a user has performed sufficient queries to complete the search;

providing a reset icon for the user to reset a search session; and

resetting the count of matching queries for the candidate documents to zero when the user selects the reset icon.

2. The computer-implemented method according to claim 1, further comprising:

receiving a request for one of the candidate documents; and

transmitting the requested candidate document in response to the request.

3. The computer-implemented method according to claim 1, wherein the documents relate to court cases.

4. The computer-implemented method according to claim 1, further comprising updating the ranking of the candidate documents as new queries are received from the user.

5. The computer-implemented method according to claim 1, further comprising:

determining a relevance score for each candidate document and query, the relevance score indicating the degree to which each candidate document matches each query, wherein the documents are ranked based at least on the relevance scores.

6. The computer-implemented method according to claim 1, further comprising:

receiving user inputs specifying weights for each of the queries, wherein the documents are ranked based at least on the weights; and

providing an interface to allow said user to deselect a query icon to determine a different set of candidate documents based on a subset of the queries received by the user.

7. A system for ranking documents, comprising:

a processor for executing program instructions; and

a non-transitory computer-readable medium storing the program instructions, the program instructions, when executed by the processor, performing a method to;

receive a first query from a user, the first query being related to a search topic;

compare the first query to a plurality of documents stored in a database to identify a first set of candidate documents, each of the first set of candidate documents matching the first query;

provide an interface to the user, the interface including references to the first set of candidate documents as well as a first query icon representing the first query;

receive a second query form the user, the second query being related to the search topic;

compare the second query to a plurality of documents stored in a database to identify a second set of candidate documents, each of the second set of candidate documents matching the second query;

compare the first and second set of candidate documents from the first query and the second query to identify an updated set of candidate documents, each of the updated set of candidate documents matching one or more of the first and second queries;

determine, for the updated set of candidate documents, a count of matching queries;

rank the updated set of candidate documents for relevance the search topic based at least on the count of matching queries for each respective candidate document; and

provide an updated interface to the user, the updated interface including references to one or more of the ranked candidate documents and the count of matching queries for each respective one or more of the ranked candidate documents as well as a second query icon representing the second query;

update a graphical user interface element comprising a progress bar which indicates whether a user has performed sufficient queries to complete the search;

provide a reset icon for the user to reset a search session; and

reset the count of matching queries for the candidate documents to zero when the user selects the reset icon.

9. The system according to claim 7, wherein the program instructions further perform the method to:

receive a request for one of the ranked candidate documents; and

transmit the requested candidate document in response to the request.

10. The system according to claim 7, wherein the documents relate to court cases.

11. The system according to claim 7, wherein the program instructions further perform the method to update the ranking of the candidate documents as new queries are received from the user.

12. The system according to claim 7, wherein the program instructions further perform the method to determine a relevance score for each candidate document and query, the relevance score indicating the degree to which each candidate document matches each query, wherein the documents are ranked based at least on the relevance scores.

13. The system according to claim 7, wherein the program instructions further perform the method to:

receive user inputs specifying weights for each of the queries, wherein the documents are ranked based at least on the weights; and

provide an interface to allow said user deselect a query icon to determine a different set of candidate documents based on a subset of the queries received by the user.

8. A non-transitory computer-readable medium storing program instructions for performing a method executed by a processor, the method for ranking documents and comprising steps performed by the processor of:

receive a first query from a user, the a first query being related to a search topic;

compare the first query to a plurality of documents stored in a database to identify a first set of candidate documents each of the first set of candidate documents matching the first query;

provide an interface to the user, the interface including references to the set of candidate documents as well as a first query icon representing the first query;

receive a second query from the user, the second query being related to the search topic

compare the second query to a plurality of documents stored in a database to indentify a second set of candidate documents, each of the second set of candidate documents matching the second query;

compare the first and second set of candidate documents from the first query and second query to the plurality of documents to identify an updated set of candidate documents, each of the updated set of candidate documents matching one or more of the first an second queries;

determine, for the updated set of candidate documents, a count of matching queries;

rank the updated set of candidate documents for relevance to the search topic based at least on the count of matching queries for each respective candidate document; and

provide an updated interface to the user, the updated interface including references to one or more of the ranked candidate documents and the count of matching queries for each respective one or more of the ranked candidate documents as well as a second query icon representing the second query;

update a graphical user interface element comprising a progress bar which indicates whether a user has performed sufficient queries to complete the search;

provide a reset icon for the user to reset a search session; and

rest the count of matching queries for the candidate documents to zero when the user selects the reset icon.

14. The non-transitory computer-readable medium according to claim 8, wherein the program instructions further perform the method to:

receive a request for one of the ranked candidate documents; and

transmit the requested candidate document in response to the request.

15. The non-transitory computer-readable medium according to claim 8, wherein the documents relate to court cases.

16. The non-transitory computer-readable medium according to claim 8, wherein the program instructions further perform the method to update the ranking of the candidate documents as new queries are received from the user.

17. The non-transitory computer-readable medium according to claim 8, wherein the program instructions further perform the method to determine a relevance score for each candidate document and query, the relevance score indicating the degree to which each candidate document matches each query, wherein the documents are ranked based at least on the relevance scores.

18. The non-transitory computer-readable medium according to claim 8, wherein the program instructions further perform the method to:

receive user inputs specifying weights for each of the queries, wherein the documents are ranked based at least on the weights; and

provide an interface to allow said user to deselect a query icon to determine a different set of candidate documents based on a subset of the queries received by the user.