Systems and Methods for Ranking Documents

• US 20150095328A1
• Filed: 12/09/2014
• Published: 04/02/2015
• Est. Priority Date: 01/15/2010
• Status: Abandoned Application

• Current Assignee: LexisNexis Group Inc. (RELX PLC)
• Original Assignee: LexisNexis Group Inc. (RELX PLC)
• Inventors: Stiver, Mark C., Koul, Vimal, Miller, Euphemia H., Seitter, Jeff A.
• Application Number:
  US14/564,676
• Publication Number:
  US 20150095328A1
• Time in Patent Office: Days
• US Class Current: 707/728
• 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, 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 for display an interface, the interface including references to the first set of candidate documents;

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

comparing the second query to the plurality of documents stored in the 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; and

providing for display an updated interface, 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.

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

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

transmitting the requested candidate document in response to the request.

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

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

receiving one or more additional queries, the one or more additional queries being related to the search topic; and

for each additional query;

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

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

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

ranking the additional 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

providing for display an updated interface, 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 an additional query icon representing the additional query.

5. The computer-implemented method according to claim 1, wherein the updated interface displays a history tree comprising a first selectable query icon representing the first query and a second selectable query icon representing the second query.

6. The computer-implemented method according to claim 1, further comprising determining a relevance score for each candidate document and query, the relevance score indicating a degree to which each candidate document matches each query, wherein candidate documents of the updated set of candidate documents are ranked based at least on the relevance scores.

7. The computer-implemented method according to claim 1, further comprising receiving inputs specifying weights for each of the queries, wherein candidate documents of the updated set of candidate documents are ranked based at least on the weights.

8. 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, 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 for display an interface, the interface including references to the first set of candidate documents;

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

compare the second query to the plurality of documents stored in the 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, using the 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; and

provide for display an updated interface, 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.

9. The system 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.

10. The system according to claim 8, wherein the plurality of documents relates to court cases.

11. The system according to claim 8, wherein the program instructions further perform the method to:

receive one or more additional queries, the one or more additional queries being related to the search topic; and

for each additional query;

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

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

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

rank the additional 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 for display an updated interface, 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 an additional query icon representing the additional query.

12. The system according to claim 8, wherein the updated interface displays a history tree comprising a first selectable query icon representing the first query and a second selectable query icon representing the second query.

13. The system 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 a degree to which each candidate document matches each query, wherein candidate documents of the updated set of candidate documents are ranked based at least on the relevance scores.

14. The system according to claim 8, wherein the program instructions further perform the method to receive inputs specifying weights for each of the queries, wherein candidate documents of the updated set of candidate documents are ranked based at least on the weights.

15. 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 to:

receive a first query, 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 for display an interface, the interface including references to the first set of candidate documents;

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

compare the second query to the plurality of documents stored in the 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, using the 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; and

provide for display an updated interface, 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.

16. The non-transitory computer-readable medium according to claim 15, 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.

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

receive one or more additional queries, the one or more additional queries being related to the search topic; and

for each additional query;

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

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

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

rank the additional 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 for display an updated interface, 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 an additional query icon representing the additional query.

18. The non-transitory computer-readable medium according to claim 15, wherein the updated interface displays a history tree comprising a first selectable query icon representing the first query and a second selectable query icon representing the second query.

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

20. The non-transitory computer-readable medium according to claim 15, wherein the program instructions further perform the method to receive inputs specifying weights for each of the queries, wherein candidate documents of the updated set of candidate documents are ranked based at least on the weights.