PATENT CLAIM ANALYSIS

Application Number: 15898284
Application Type: Utility
Filing Date: 2018-02
Publication Date: 2018-12
Patent Classification: ["704", "009000"]

Abstract:
Generating, updating, and using a knowledge graph. Concepts in a knowledge graph can have relations to one another. These relations may be expressed as confidence values. A training data set may be split into two portions, with the first portion used to update confidence values for existing relations between concept pairs, using the knowledge graph. These confidence values can be used, together with the second portion used to update confidence values for known phrases that express known relations. These confidence values, in turn, can be used, together with the first portion, to increase the accuracy of the original confidence scores with respect to existing relations. The process may be iteratively employed, with each iteration increasing the accuracy of confidence scores.

Claim (Index 1):
A computer implemented method for, updating an electronically stored knowledge graph of a knowledge domain, comprising:\n receiving a natural language text comprising sentences; splitting the sentences into at least a first portion and a second portion; identifying pairs of concepts in the sentences of the first portion; determining, for a first sentence corresponding to at least one sentence in the first portion having a concept pair, a likelihood that the first sentence exhibits an existing relation between concepts of the concept pair, wherein the determined likelihood represents a first confidence value; determining, for a second sentence corresponding to at least one sentence in the second portion having the concept pair, a likelihood that a word or phrase connecting concepts of the concept pair exhibits the existing relation, wherein the determined likelihood represents a second confidence value and is based, in part, on the first confidence value; determining, for a third sentence corresponding to at least one sentence in the first portion having the concept pair, a likelihood that the third sentence exhibits the existing relation, wherein the determined likelihood represents a third confidence value, and is based, in part, on the second confidence value; iteratively determining successive likelihoods according to the first, second, and the third confidence values, by alternating between sentences of the first portion and sentences of the second portion until the successive likelihoods reach corresponding threshold confidence values, wherein determining, for at least one sentence in the first portion having a concept pair, a likelihood that the sentence is an instance of the concepts in the concept pair exhibiting an existing relation, is based on identifying one or more concept pairs in the at least one sentence, the identifying comprising:\n comparing words of the at least one sentence in the first portion to elements of a knowledge graph; \n identifying matching words as concepts; and \n pairing at least two of the identifying concepts with one another to form a concept pair; and \n updating the reference knowledge graph to include relations between concepts whose corresponding confidence scores exceed a threshold value; and using the updated reference knowledge graph in an analysis of additional natural language text.

Metadata:
- Claim Count in Document: 1.0
- Percentile: 88.0
- Lexical Diversity: 2.1746
- Patent Class: 704.0
- Transitional Phrase Type: open
- Component Type: 1
- Foreign Priority: False
- Related Applications: ['15629891', '15629896', '15898296', '15488708', '15609800']

Analysis Scores:
- 35 USC 101 Eligibility (BERT): 0.2795172964138683
- 35 USC 102 Novelty (BERT): 0.5691856496533153
- Combined Prediction Score: 0.308484131737813
- Mean Citation Score: 329.9146580000001
- Max Citation Score: 434.26205
- Similarity Product: 424.5722578756272

Labels:
- Claim Label 101: 0
- Claim Label 102: 1
- Claim Label 103: 1
- Claim Label 112: 1
- Combined Label: 0
- Label 101 Adjusted: 0

Dataset: test