IP Library Patent Application 16994189
Patent Application
App. No. 16/994,189

SYSTEMS AND METHODS FOR TEXT BASED KNOWLEDGE MINING

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 None
App. No.
16/994,189
Abstract

A method of text based knowledge mining, the method including receiving, by a processing system, a plurality of textual records from one or more data sources and extracting, by the processing system, entities from the plurality of textual records, wherein the entities represent proper nouns in the plurality of textual records. The method further includes extracting, by the processing system, characteristic phrases associated with the one or more entities from the plurality of textual records, determining, by the processing system, topic entities from the entities, wherein the topic entities define a category that one or more of the entities fall within, and performing, by the processing system, a hierarchy analysis to generate hierarchy data based on the entities, the topic entities, and the characteristic phrases.

Claims (52)

1 . A method of text based knowledge mining, the method comprising:

receiving, by a processing system, a plurality of textual records from one or more data sources;

extracting, by the processing system, entities from the plurality of textual records, wherein the entities represent proper nouns in the plurality of textual records;

extracting, by the processing system, characteristic phrases associated with the one or more entities from the plurality of textual records;

determining, by the processing system, topic entities from the entities, wherein the topic entities define a category that one or more of the entities fall within; and

performing, by the processing system, a hierarchy analysis to generate hierarchy data based on the entities, the topic entities, and the characteristic phrases.

2 . The method of claim 1 , wherein the hierarchy data comprises sunburst data representing a sunburst chart;

wherein the method further comprises generating, by the processing system, a user interface comprising the sunburst chart based on the sunburst data.

3 . The method of claim 1 , wherein the method further comprises determining related entities of the entities by analyzing a knowledge graph, wherein the knowledge graph comprises one or more entities and relationships between the one or more entities.

4 . The method of claim 1 , wherein determining, by the processing system, the topic entities from the entities comprises:

determining a sentiment level for each of the entities; and

determining the topic entities from the entities based on one or more models and the sentiment level for each of the entities.

5 . The method of claim 4 , wherein the sentiment level is at least one of a positive sentiment level, a negative sentiment level, or a neutral sentiment level.

6 . The method of claim 1 , the method further comprising:

extracting, by the processing system, n-grams from the plurality of textual records, wherein the n-grams are each a particular number of co-occurring words in the plurality of textual records;

generating, by the processing system, n-gram topics based on the n-grams by determining an influence score of each of the n-grams in the plurality of textual records and setting the n-gram topics to particular n-grams with highest influence scores;

determining, by the processing system, similar n-grams of the n-grams; and

generating, by the processing system, a user interface comprising an indication of the n-gram topics and the similar n-grams.

7 . The method of claim 6 , wherein determining, by the processing system, the similar n-grams of the n-grams comprises performing at least one of a textual similarity analysis or a semantic similarity analysis.

8 . The method of claim 6 , wherein determining, by the processing system, the similar n-grams of the n-grams comprises determining a similarity score between each of the n-grams.

9 . A computer system including circuitry, servers, or processors configured to perform:

receiving a plurality of textual records from one or more data sources;

extracting entities from the plurality of textual records, wherein the entities represent proper nouns in the plurality of textual records;

extracting characteristic phrases associated with the one or more entities from the plurality of textual records;

determining topic entities from the entities, wherein the topic entities define a category that one or more of the entities fall within; and

performing a hierarchy analysis to generate hierarchy data based on the entities, the topic entities, and the characteristic phrases.

10 . The computer system of claim 9 , wherein the hierarchy data comprises sunburst data representing a sunburst chart;

wherein the circuitry, servers, or processors are configured to perform generating a user interface comprising the sunburst chart based on the sunburst data.

11 . The computer system of claim 9 , wherein the circuitry, servers, or processors configured to perform determining related entities of the entities by analyzing a knowledge graph, wherein the knowledge graph comprises one or more entities and relationships between the one or more entities.

12 . The computer system of claim 9 , wherein determining the topic entities from the entities comprises:

determining a sentiment level for each of the entities; and

determining the topic entities from the entities based on one or more models and the sentiment level for each of the entities.

13 . The computer system of claim 12 , wherein the sentiment level is at least one of a positive sentiment level, a negative sentiment level, or a neutral sentiment level.

14 . The computer system of claim 9 , wherein the circuitry, servers, or processors are configured to perform:

extracting n-grams from the plurality of textual records, wherein the n-grams are each a particular number of co-occurring words in the plurality of textual records;

generating n-gram topics based on the n-grams by determining an influence score of each of the n-grams in the plurality of textual records and setting the n-gram topics to particular n-grams with highest influence scores;

determining similar n-grams of the n-grams; and

generating a user interface comprising an indication of the n-gram topics and the similar n-grams.

15 . The computer system of claim 14 , wherein determining the similar n-grams of the n-grams comprises performing at least one of a textual similarity analysis or a semantic similarity analysis.

16 . The computer system of claim 14 , wherein determining the similar n-grams of the n-grams comprises determining a similarity score between each of the n-grams.

17 . A non-transient computer readable medium containing instructions, wherein the instructions cause one or more processors to:

receive a plurality of textual records from one or more data sources;

extract entities from the plurality of textual records, wherein the entities represent proper nouns in the plurality of textual records;

extract characteristic phrases associated with the one or more entities from the plurality of textual records;

determine topic entities from the entities, wherein the topic entities define a category that one or more of the entities fall within; and

perform a hierarchy analysis to generate hierarchy data based on the entities, the topic entities, and the characteristic phrases.

18 . The non-transient computer readable medium of claim 17 , wherein the hierarchy data comprises sunburst data representing a sunburst chart;

wherein the instructions cause the one or more processors to generate a user interface comprising the sunburst chart based on the sunburst data.

19 . The non-transient computer readable medium of claim 17 , wherein the instructions cause the one or more processors to determine related entities of the entities by analyzing a knowledge graph, wherein the knowledge graph comprises one or more entities and relationships between the one or more entities.

20 . The non-transient computer readable medium of claim 17 , wherein determining the topic entities from the entities comprises:

determining a sentiment level for each of the entities; and

determining the topic entities from the entities based on one or more models and the sentiment level for each of the entities.

Assignments (7)
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Mar 5, 2025
From: TNHC INVESTMENTS LLC
To: THE NORTH HIGHLAND COMPANY LLC
Reel/Frame 070409/0717 →
TERMINATION AND RELEASE OF SECURITY INTEREST IN PATENTS RECORDED AT REEL 062212/FRAME 0580 Recorded Dec 23, 2024
From: BANK OF AMERICA, N.A.
To: TNHC INVESTMENTS LLC
Reel/Frame 069762/0103 →
NOTICE OF GRANT OF SECURITY INTEREST IN PATENTS Recorded Dec 23, 2022
From: TNHC INVESTMENTS LLC
To: BANK OF AMERICA, N.A., AS ADMINISTRATIVE AGENT
Reel/Frame 062212/0580 →
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Mar 17, 2022
From: DECOODA INTERNATIONAL, INC.
To: TNHC INVESTMENTS LLC
Reel/Frame 059296/0001 →
RELEASE OF SECURITY INTEREST Recorded Mar 17, 2022
From: GEORGE KAISER FAMILY FOUNDATION
To: DECOODA INTERNATIONAL, INC.
Reel/Frame 059295/0890 →
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Feb 3, 2022
From: WARDELL, CHARLES; JOHNSON, DAVID; RAGHAVAN, GURU PRASAD VENKATA
To: DECOODA INTERNATIONAL, INC.
Reel/Frame 058881/0095 →
SECURITY INTEREST Recorded Aug 13, 2021
From: DECOODA INTERNATIONAL INC.
To: GEORGE KAISER FAMILY FOUNDATION
Reel/Frame 057170/0079 →