IP Library Granted Patent US 10,891,321
Granted Patent B2
US 10,891,321 · App. 16/553,148 · Granted Jan 12, 2021

Systems and methods for performing a computer-implemented prior art search

Inventors: Mark Ryan Grabau (Westerville, OH); John David Fleig (Hilliard, OH); Dmitrii Arkadyevich Polshakov (Columbus, OH); Jeffrey Michael Wilson (Upper Arlington, OH); Rodney Laroy Fulford (Reynoldsburg, OH); Yi Deng (Powell, OH); Philippe Yves Ayala (Columbus, OH); Donald Eugene Swartwout (Powell, OH); Christopher Ryan Gessner (Columbus, OH)
Assignee: American Chemical Society
G06F16/328G06F16/335G06F16/93G06F17/16G06N3/02
View Patent ↗
Loading inventors, assignments & file history…
Monitor This Case
Get email alerts when status or documents change.
Order Certified Copies
Most orders are placed with the USPTO same day — all within 24 business hours.
Order via The Patent Place →
Pre-filled with this patent's details
Quick Facts
Patent No.
US 10,891,321
App. No.
16/553,148
Granted
Jan 12, 2021
Kind
B2
Abstract

In some embodiments, a computer-implemented method for retrieving a similar document from a corpus of documents is provided. The method may include receiving a search document comprising a set of words; applying a first encoder to generate a first vector; applying a second encoder to generate a second vector; determining a first similarity between the first vector of the search document and the first vector of each document of the corpus of documents; determining a second similarity between the second vector of the search document and the second vector of each document of the corpus of documents; generating a first ranked list of documents based on the first similarity; generating a second ranked list of documents based on the second similarity; applying a voting algorithm to determine a score associated with each document; and outputting a third ranked list of documents based on the determined score.

Claims (42)

1. A computer-implemented method for retrieving a similar document from a corpus of documents, the method comprising:

receiving a search document, the search document comprising a set of words;

applying a first encoder to the set of words to generate a first vector;

applying a second encoder to the set of words to generate a second vector;

determining a first similarity between the first vector of the search document and the first vector of each document of the corpus of documents;

determining a second similarity between the second vector of the search document and the second vector of each document of the corpus of documents;

generating a first ranked list of documents in the corpus based on the first similarity;

generating a second ranked list of documents in the corpus based on the second similarity;

applying a voting algorithm to determine a score associated with each document based on a position of each document in its relative ranked list; and

outputting a third ranked list of documents based on the determined score.

2. The method of claim 1 , further comprising:

applying a model to the set of words of the search document to generate one or more tags associated with the search document.

3. The method of claim 2 , further comprising:

based on the one or more tags, updating a node-edge graph associated with the corpus of documents with the search document; and

generate a ranked list of documents sharing an edge with the search document.

4. The method of claim 3 , wherein the score is based, in part, on the node-edge graph.

5. The method of claim 1 , wherein the first encoder comprises a neural network encoder.

6. The method of claim 1 , wherein applying the second encoder comprises parsing the set of words and removing occurrences of a stop word from the set of words, thereby generating a subset of words.

7. The method of claim 6 , further comprising:

determining the number of times each of the subset of words appears in the subset of words; and

determining a rarity of each of the subset of words.

8. The method of claim 7 , wherein the rarity comprises a number of times a word appears in the search document compared to a number of times the word appears in the corpus of documents.

9. The method of claim 1 , further comprising:

receiving a filtering rule comprising a condition;

filtering the third ranked list based on the condition; and

outputting a fourth ranked list.

10. A computer program product comprising a non-transitory computer readable medium having a computer readable program embodied therein, wherein the computer readable program, when executed on a computing device, causes the computing device to:

receive a search document, the search document comprising a set of words;

apply a first encoder to the set of words to generate a first vector;

apply a second encoder to the set of words to generate a second vector;

determine a first similarity between the first vector of the search document and the first vector of each document of the corpus of documents;

determine a second similarity between the second vector of the search document and the second vector of each document of the corpus of documents;

generate a first ranked list of documents in the corpus based on the first similarity;

generate a second ranked list of documents in the corpus based on the second similarity;

apply a voting algorithm to determine a score associated with each document based on a position of each document in its relative ranked list; and

output a third ranked list of documents based on the determined score.

11. The computer-readable medium of claim 10 , wherein the program further causes the computing device to:

apply the first encoder using a semantic vector module comprising a deep learning encoder;

apply the second encoder using a syntactic module configured to: determine a number of times each of the set of words appears in the search document,

determine a number of times each of the set of words appears in the corpus of documents, and

generate the second vector representing a comparison of the number of times each word appears in the document to the number of times each word appears in the corpus of documents; and

apply a knowledge graph module configured to update a knowledge graph with a node comprising the search document.

Assignments (1)
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Sep 10, 2019
From: GRABAU, MARK RYAN; FLEIG, JOHN DAVID; POLSHAKOV, DMITRII ARKADYEVICH; WILSON, JEFFREY MICHAEL; FULFORD, RODNEY LAROY; DENG, YI; AYALA, PHILIPPE YVES; SWARTWOUT, DONALD EUGENE; GESSNER, CHRISTOPHER RYAN
To: AMERICAN CHEMICAL SOCIETY
Reel/Frame 050331/0319 →
Continuity (2)
Provisional Application 62723959 · Aug 28, 2018
Related Publication 20200073879A1 · Mar 5, 2020