IP Library Granted Patent US 12,585,891
Granted Patent B2
US 12,585,891 · App. 19/080,459 · Granted Mar 24, 2026

Natural language generation using knowledge graph incorporating textual summaries

Inventor: Waseem AlShikh (Boca Raton, FL)
Assignee: Writer, Inc.
G06F40/40G06F16/33295G06F16/345G06F40/30G06N5/04
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 12,585,891
App. No.
19/080,459
Granted
Mar 24, 2026
Kind
B2
Abstract

Some techniques relate to generating a knowledge graph including textual passages and textual summaries usable for producing an answer to a question relating to a domain. A corpus of textual information is received. Textual passages and descriptions of associations between textual passages from a first language model are obtained by providing at least a portion of the corpus of textual information to the first language model. Textual summaries corresponding to textual passages are obtained from a second language model. A knowledge graph is generated based on the textual passages, descriptions of associations between the textual passages, and textual summaries. The knowledge graph is stored in a non-transitory computer readable medium.

Claims (44)

1 . A computer-implemented method for generating a knowledge graph including textual passages and textual summaries usable for producing an answer to a question relating to a domain, the method comprising:

receiving a corpus of textual information;

obtaining textual passages and descriptions of associations between textual passages from a first language model by providing at least a portion of the corpus of textual information to the first language model, wherein the first language model is pre-trained to produce an output of textual passages and descriptions of associations between textual passages based on an input to the first language model without reference to a pre-determined ontology;

obtaining textual summaries corresponding to textual passages from a second language model;

generating a knowledge graph based on the textual passages, descriptions of associations between the textual passages, and textual summaries;

storing the knowledge graph in a non-transitory computer readable medium;

receiving a natural language textual sequence representing a textual input;

retrieving a set of textual passages from the knowledge graph by comparing the natural language textual sequence against the textual passages in the knowledge graph using a cosine similarity metric, wherein the set of textual passages are retrieved by ranking the textual passages based on the comparison, and selecting the set of textual passages having a value over a threshold value; and

obtaining a textual output to the textual input from the second language model by providing the second language model with the natural language textual sequence, the set of textual passages, and the textual summaries.

2 . The method of claim 1 , wherein the generated knowledge graph includes a tree corresponding to a first document of the textual information, a root of the tree corresponding to a summary of the first document, nodes of the tree corresponding to textual summaries of portions of the first document, and leaves of the tree corresponding to textual passages of the first document.

3 . The method of claim 1 , further comprising:

pre-processing the portion of the corpus of textual information using a context-aware splitting model to produce output of a size less than a context window of the first language model.

4 . The method of claim 1 , wherein the first language model is a decoder-only model.

5 . The method of claim 1 , wherein the output of textual passages and associations between textual passages is formatted in a JavaScript Object Notation format and the knowledge graph is stored in a relational database.

6 . A system comprising:

one or more processors; and

one or more non-transitory computer-readable media storing instructions, which, when executed by the system, cause the system to perform a set of actions including:

receiving a corpus of textual information;

obtaining textual passages and descriptions of associations between textual passages from a first language model by providing at least a portion of the corpus of textual information to the first language model, wherein the first language model is pre-trained to produce an output of textual passages and descriptions of associations between textual passages based on an input to the first language model without reference to a pre-determined ontology;

obtaining textual summaries corresponding to textual passages from a second language model;

generating a knowledge graph based on the textual passages, descriptions of associations between the textual passages, and textual summaries;

storing the knowledge graph in a non-transitory computer readable medium;

receiving a natural language textual sequence representing a textual input;

retrieving a set of textual passages from the knowledge graph by comparing the natural language textual sequence against the textual passages in the knowledge graph using a cosine similarity metric, wherein the set of textual passages are retrieved by ranking the textual passages based on the comparison, and selecting the set of textual passages having a value over a threshold value; and

obtaining a textual output to the textual input from the second language model by providing the second language model with the natural language textual sequence, the set of textual passages, and the textual summaries.

7 . The system of claim 6 , wherein the generated knowledge graph includes a tree corresponding to a first document of the textual information, a root of the tree corresponding to a summary of the first document, nodes of the tree corresponding to textual summaries of portions of the first document, and leaves of the tree corresponding to textual passages of the first document.

8 . The system of claim 6 , wherein the set of actions further includes:

pre-processing the portion of the corpus of textual information using a context-aware splitting model to produce output of a size less than a context window of the first language model.

9 . The system of claim 6 , wherein the first language model is a decoder-only model.

10 . The system of claim 6 , wherein the output of textual passages and associations between textual passages is formatted in a JavaScript Object Notation format and the knowledge graph is stored in a relational database.

11 . A computer-program product tangibly embodied in a non-transitory machine-readable storage medium, including instructions configured to cause one or more data processors to perform part or all of one or more methods disclosed herein:

receiving a corpus of textual information;

obtaining textual passages and descriptions of associations between textual passages from a first language model by providing at least a portion of the corpus of textual information to the first language model, wherein the first language model is pre-trained to produce an output of textual passages and descriptions of associations between textual passages based on an input to the first language model without reference to a pre-determined ontology;

obtaining textual summaries corresponding to textual passages from a second language model;

generating a knowledge graph based on the textual passages, descriptions of associations between the textual passages, and textual summaries;

storing the knowledge graph in a non-transitory computer readable medium;

receiving a natural language textual sequence representing a textual input;

retrieving a set of textual passages from the knowledge graph by comparing the natural language textual sequence against the textual passages in the knowledge graph using a cosine similarity metric, wherein the set of textual passages are retrieved by ranking the textual passages based on the comparison, and selecting the set of textual passages having a value over a threshold value; and

obtaining a textual output to the textual input from the second language model by providing the second language model with the natural language textual sequence, the set of textual passages, and the textual summaries.

12 . The computer-program product of claim 11 , wherein the generated knowledge graph includes a tree corresponding to a first document of the textual information, a root of the tree corresponding to a summary of the first document, nodes of the tree corresponding to textual summaries of portions of the first document, and leaves of the tree corresponding to textual passages of the first document.

13 . The computer-program product of claim 11 , wherein set of actions further includes:

pre-processing the portion of the corpus of textual information using a context-aware splitting model to produce output of a size less than a context window of the first language model.

14 . The computer-program product of claim 11 , wherein the first language model is a decoder-only model.

15 . The computer-program product of claim 11 , wherein the output of textual passages and associations between textual passages is formatted in a JavaScript Object Notation format and the knowledge graph is stored in a relational database.

Assignments (2)
SECURITY INTEREST Recorded May 21, 2026
From: WRITER, INC.
To: JPMORGAN CHASE BANK, N.A.
Reel/Frame 074728/0276 →
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Mar 20, 2025
From: ALSHIKH, WASEEM
To: WRITER, INC.
Reel/Frame 070578/0400 →
Continuity (2)
Provisional Application 63654558 · May 31, 2024
Related Publication 20250371285A1 · Dec 4, 2025
References Cited (42)
US 5857198A · Schmidt · 1999 [cited by applicant]
US 9940367B1 · Baker et al. · 2018 [cited by applicant]
US 10019513B1 · Koren et al. · 2018 [cited by applicant]
US 10180964B1 · Baker et al. · 2019 [cited by applicant]
US 10572516B2 · Walia et al. · 2020 [cited by applicant]
US 10678821B2 · Carmeli et al. · 2020 [cited by applicant]
US 10817576B1 · Davidovich et al. · 2020 [cited by applicant]
US 10909157B2 · Paulus et al. · 2021 [cited by applicant]
US 12259914B1 · Gao et al. · 2025 [cited by applicant]
US 20070179944A1 · Van Dyke Parunak et al. · 2007 [cited by applicant]
US 20160267117A1 · Guggilla et al. · 2016 [cited by applicant]
US 20180307776A1 · Ferradini et al. · 2018 [cited by applicant]
US 20180336183A1 · Lee et al. · 2018 [cited by applicant]
US 20190005024A1 · Somech et al. · 2019 [cited by applicant]
US 20190206517A1 · Devarakonda et al. · 2019 [cited by applicant]
US 20200074322A1 · Chungapalli et al. · 2020 [cited by applicant]
US 20210191937A1 · Jia et al. · 2021 [cited by applicant]
US 20210192126A1 · Gehrmann et al. · 2021 [cited by applicant]
US 20210295822A1 · Tomkins et al. · 2021 [cited by applicant]
US 20220277135A1 · Kryscinski et al. · 2022 [cited by applicant]
US 20230267275A1 · Au · 2023 [cited by applicant]
US 20230420146A1 · Jegannathan et al. · 2023 [cited by applicant]
US 20240095460A1 · Xu et al. · 2024 [cited by applicant]
US 20240168984A1 · Kim et al. · 2024 [cited by applicant]
US 20250061291A1 · Gardner · 2025 [cited by examiner]
US 20250272276A1 · Ban · 2025 [cited by examiner]
US 20250272508A1 · Russell · 2025 [cited by applicant]
US 20250308120A1 · Dai et al. · 2025 [cited by applicant]
KR 20200087977A · 2020 [cited by applicant]
KR 102775064B1 · 2025 [cited by applicant]
WO 2019226474A1 · 2019 [cited by applicant]
Non-Final Office Action for U.S. Appl. No. 19/080,452, dated Apr. 28, 2025. [cited by applicant]
Non-Final Office Action for U.S. Appl. No. 19/080,464, dated May 28, 2025. [cited by applicant]
Non-Final Office Action for U.S. Appl. No. 19/080,465, dated May 23, 2025. [cited by applicant]
Non-Final Office Action for U.S. Appl. No. 19/080,472, dated May 16, 2025. [cited by applicant]
Zhu, Tianyu, et al. “Summarizing long-form document with rich discourse information.” Proceedings of the 30th ACM international conference on information & knowledge management. 2021. (Year: 2021). [cited by applicant]
Final Office Action notified Jul. 22, 2025 for U.S. Appl. No. 19/080,452. [cited by applicant]
Final Office Action for U.S. Appl. No. 19/080,464 notified Nov. 18, 2025. [cited by applicant]
Final Office Action for U.S. Appl. No. 19/080,472 notified Sep. 5, 2025. [cited by applicant]
Final Office Action notified for U.S. Appl. No. 19/080,465, dated Oct. 10, 2025. [cited by applicant]
Notice of Allowance for U.S. Appl. No. 19/080,452 notified Nov. 28, 2025. [cited by applicant]
Notice of Allowance for U.S. Appl. No. 19/080,472 notified Jan. 13, 2026. [cited by applicant]