IP Library Granted Patent US 12,373,647
Granted Patent B2
US 12,373,647 · App. 17/892,026 · Granted Jul 29, 2025

Semantic map generation from natural-language text documents

Inventor: Edward Hunter (Gaithersburg, MD)
Assignee: Digital Asset Capital, Inc
G06F40/30G06F16/34G06F16/367G06F16/9024G06F16/9038G06F16/93G06F40/117G06F40/137G06F40/169G06F40/20G06F40/211G06F40/258G06F40/284G06N5/022G06Q50/18
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,373,647
App. No.
17/892,026
Granted
Jul 29, 2025
Kind
B2
Abstract

Techniques include obtaining, with a computer system, a natural-language-text document comprising unstructured text; generating, with the computer system, based on a first set of machine learning model parameters, a neural representation of the unstructured text; identifying, with the computer system, based on the neural representation, a trigger word located within the unstructured text and associated with a first category; determining, with the computer system, based on the trigger word, a region within the unstructured text comprising descriptors associated with the first category; determining, with the computer system, from the region based on a second set of machine learning model parameters, a descriptor describing an action or condition of the first category; generating, with the computer system, a data model object comprising the descriptor defining an action or condition of the first category; and storing, with the computer system, the data model object in memory.

Claims (58)

1. A tangible, non-transitory, machine-readable medium storing instructions that when executed by one or more processors effectuate operations comprising:

obtaining, with a computer system, a natural-language-text document comprising unstructured text;

generating, with the computer system, based on a first set of machine learning model parameters, a neural representation of the unstructured text, the neural representation including a sequence of a plurality of embedding vectors;

identifying, with the computer system, based on the neural representation, a trigger word located within the unstructured text and associated with a first category, wherein the trigger word is associated with the first category by using a multi-headed attention model;

determining, with the computer system, based on the trigger word, a region within the unstructured text comprising descriptors associated with the first category;

determining, with the computer system, from the region based on a second set of machine learning model parameters, a descriptor describing an action or condition of the first category;

generating, with the computer system, a data model object comprising the descriptor defining an action or condition of the first category;

storing, with the computer system, the data model object in memory; and

annotating the document with semantic triples based on the data model object, wherein the operations further comprise:

extracting, with the computer system, a document structure corresponding to the unstructured text of the natural-language-text document wherein extracting the document structure comprises:

extracting hierarchical structure within the document structure using cascading finite state machines; and

converting each branch of the document corresponding to a clause into a tagged token sequence by using a subcategorization frame template;

generating, with the computer system, based on the document structure, a directed graph representing contents of the text of the natural-language text document; and

assigning, with the computer system, based on the directed graph, a label corresponding to each word of the text to generate a tagged token sequence.

2. The medium of claim 1 , wherein the directed graph comprises:

a first graph vertex based on a first clause and associated with the data model object;

a second graph vertex based on a second clause; and

a first graph edge comprising an identifier of the data model object and an identifier of the second graph vertex.

3. The medium of claim 1 , the operations further comprising:

generating, with the computer system, an annotated document comprising annotations within the document structure, wherein vertices are annotated with descriptors corresponding to the first category; and

causing, with the computer system, a visualization of the annotated document structure in a selectable user interface (UI) to be displayed on a display device of a user.

4. The medium of claim 1 , the operations further comprising:

determining, with the computer system, based on a second trigger word and a third trigger word, a second and a third region within the unstructured text comprising descriptors associated with a second category and a third category, respectively;

determining, with the computer system, based on a second set of machine learning model parameters, a descriptor describing an action or condition of the second and third category;

wherein generating the data model object comprises:

populating a first field with the first category, wherein the first category corresponds to a right;

populating a second field with the second category, wherein the second category corresponds to an obligation; and

populating a third field with the third category, wherein the third category corresponds to a prohibition.

5. The medium of claim 1 , further comprising determining definitional statements within the text and replacing the definitional statements with lexical equivalents.

6. The medium of claim 1 , wherein each vertex of the directed graph represents a clause comprising rights, obligations, and prohibitions.

7. The medium of claim 1 , wherein each edge of the directed graph represents a relationship between clauses.

8. The medium of claim 1 , wherein the tagged token sequence is applied as an input to the first set of machine learning model parameters.

9. The medium of claim 1 , wherein generating the neural representation of the text sequence comprises replacing tokens and tags using an embedding layer to generate vector representations of each clause.

10. The medium of claim 1 , wherein the category is a right, obligation, or prohibition associated with a clause.

11. The medium of claim 10 , wherein identifying the category comprises identifying trigger words by using n-gram patterns.

12. The medium of claim 11 , the operations further comprising identifying additional categories, wherein additional categories comprise an event, a condition, a non-obligation, and a failure.

13. The medium of claim 1 , wherein determining the set of words defining an action or condition of the category comprises using a style template to compute an output score for each vector representation of clauses and selecting the vector representation having a highest output score.

14. The medium of claim 1 , wherein storing the data model object in memory comprises storing a data structure comprising the data model object in a distributed, tamper-evident data store of a peer-to-peer sharing network.

15. The medium of claim 3 , the operations further comprising:

indexing a first graph vertex based on the first category;

wherein causing the display of the visualization comprises:

retrieving the identifier of the first graph vertex based on the first category; and

displaying text stored in association with the first graph vertex.

16. The medium of claim 1 , wherein determining the data model object comprises steps for determining the data model object.

17. A method, comprising:

obtaining, with a computer system, a natural-language-text document comprising unstructured text, wherein the unstructured text comprises a plurality of clauses;

generating, with the computer system, based on a first set of machine learning model parameters, a neural representation of the unstructured text, the neural representation including a sequence of a plurality of embedding vectors;

identifying, with the computer system, a trigger word within the unstructured text and is associated with a first category, wherein the trigger word is associated with the first category by using a multi-headed attention model;

determining, with the computer system, based on the trigger word, a location within the unstructured text comprising descriptors associated with the first category;

determining, with the computer system, based on a second set of machine learning model parameters, a descriptor describing an action or condition of the first category;

generating, with the computer system, a data model object comprising the descriptor defining an action or condition of the first category;

storing, with the computer system, the data model object in memory; and

annotating the document with semantic triples based on the data model object, wherein the operations further comprise:

extracting, with the computer system, a document structure corresponding to the unstructured text of the natural-language-text document wherein extracting the document structure comprises:

extracting hierarchical structure within the document structure using cascading finite state machines; and

converting each branch of the document corresponding to a clause into a tagged token sequence by using a subcategorization frame template;

generating, with the computer system, based on the document structure, a directed graph representing contents of the text of the natural-language text document; and

assigning, with the computer system, based on the directed graph, a label corresponding to each word of the text to generate a tagged token sequence.

Assignments (1)
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Mar 9, 2023
From: HUNTER, EDWARD
To: DIGITAL ASSET CAPITAL, INC.
Reel/Frame 062931/0872 →
Continuity (3)
Provisional Application 63282583 · Nov 23, 2021
Provisional Application 63234978 · Aug 19, 2021
Related Publication 20230059494A1 · Feb 23, 2023
References Cited (83)
US 8766666B2 · Dlugosch · 2014 [cited by examiner]
US 8977953B1 · Pierre · 2015 [cited by examiner]
US 9263052B1 · Talkin · 2016 [cited by applicant]
US 10121467B1 · Gandhe et al. · 2018 [cited by applicant]
US 10191788B2 · Dlugosch · 2019 [cited by examiner]
US 10445698B2 · Hunn · 2019 [cited by examiner]
US 10460162B2 · Gelosi · 2019 [cited by examiner]
US 10650186B2 · Gelosi · 2020 [cited by examiner]
US 10726198B2 · Gelosi · 2020 [cited by examiner]
US 10831452B1 · Hunter · 2020 [cited by examiner]
US 10915578B1 · Hunter · 2021 [cited by examiner]
US 10990879B2 · Hunter · 2021 [cited by examiner]
US 11017778B1 · Thomson · 2021 [cited by examiner]
US 11087219B1 · Brecque · 2021 [cited by examiner]
US 11132403B2 · Hunter · 2021 [cited by examiner]
US 11145312B2 · Thomson et al. · 2021 [cited by applicant]
US 11170761B2 · Thomson et al. · 2021 [cited by applicant]
US 11256856B2 · Gelosi · 2022 [cited by examiner]
US 11379735B2 · Brecque · 2022 [cited by examiner]
US 11393024B1 · Kodihalli · 2022 [cited by examiner]
US 11475209B2 · Gelosi · 2022 [cited by examiner]
US 11526333B2 · Hunter · 2022 [cited by examiner]
US 11526614B2 · Fang · 2022 [cited by examiner]
US 11544468B2 · Manandise · 2023 [cited by examiner]
US 11568505B2 · Hunn · 2023 [cited by examiner]
US 11803706B2 · Pito · 2023 [cited by examiner]
US 11967312B2 · Yuan · 2024 [cited by examiner]
US 20090012842A1 · Srinivasan · 2009 [cited by examiner]
US 20110307433A1 · Dlugosch · 2011 [cited by examiner]
US 20130346066A1 · Deoras et al. · 2013 [cited by applicant]
US 20170060649A1 · Dlugosch · 2017 [cited by examiner]
US 20180005186A1 · Hunn · 2018 [cited by examiner]
US 20180365201A1 · Hunn · 2018 [cited by examiner]
US 20190114479A1 · Gelosi · 2019 [cited by examiner]
US 20190122317A1 · Hunn · 2019 [cited by examiner]
US 20190220503A1 · Gelosi · 2019 [cited by examiner]
US 20190303541A1 · Reddy · 2019 [cited by examiner]
US 20190303579A1 · Reddy · 2019 [cited by examiner]
US 20190303623A1 · Reddy · 2019 [cited by examiner]
US 20190305957A1 · Reddy · 2019 [cited by examiner]
US 20190305959A1 · Reddy · 2019 [cited by examiner]
US 20190306173A1 · Reddy · 2019 [cited by examiner]
US 20190377779A1 · Gelosi · 2019 [cited by examiner]
US 20200057994A1 · Hunn · 2020 [cited by examiner]
US 20200143366A1 · Liu et al. · 2020 [cited by applicant]
US 20200143372A1 · Liu et al. · 2020 [cited by applicant]
US 20200175961A1 · Thomson et al. · 2020 [cited by applicant]
US 20200243094A1 · Thomson · 2020 [cited by examiner]
US 20210073282A1 · Hunter · 2021 [cited by examiner]
US 20210073284A1 · Hunter · 2021 [cited by examiner]
US 20210073285A1 · Hunter · 2021 [cited by examiner]
US 20210073286A1 · Hunter · 2021 [cited by examiner]
US 20210073287A1 · Hunter · 2021 [cited by examiner]
US 20210073288A1 · Hunter · 2021 [cited by examiner]
US 20210073289A1 · Hunter · 2021 [cited by examiner]
US 20210073290A1 · Hunter · 2021 [cited by examiner]
US 20210073291A1 · Hunter · 2021 [cited by examiner]
US 20210073647A1 · Hunter · 2021 [cited by examiner]
US 20210110047A1 · Fang · 2021 [cited by examiner]
US 20210149958A1 · Hunter · 2021 [cited by examiner]
US 20210150128A1 · Gelosi · 2021 [cited by examiner]
US 20210157975A1 · Gelosi · 2021 [cited by examiner]
US 20210295321A1 · Liu et al. · 2021 [cited by applicant]
US 20210342530A1 · Wu · 2021 [cited by examiner]
US 20210366065A1 · Zhou · 2021 [cited by examiner]
US 20210374672A1 · Hunn · 2021 [cited by examiner]
US 20210383247A1 · Brecque · 2021 [cited by examiner]
US 20220027564A1 · Manandise · 2022 [cited by examiner]
US 20220028397A1 · Thomson et al. · 2022 [cited by applicant]
US 20220036890A1 · Yuan · 2022 [cited by examiner]
US 20220059077A1 · Thomson · 2022 [cited by applicant]
US 20220122587A1 · Thomson et al. · 2022 [cited by applicant]
US 20220284215A1 · Rastogi et al. · 2022 [cited by applicant]
US 20220335553A1 · Chew · 2022 [cited by examiner]
US 20220398256A1 · Hartline · 2022 [cited by examiner]
US 20230140938A1 · Sun · 2023 [cited by examiner]
US 20230162304A1 · Hunn · 2023 [cited by examiner]
CN 114064920A · 2022 [cited by examiner]
CN 114661914A · 2022 [cited by examiner]
CN 115269874A · 2022 [cited by examiner]
CN 115422904A · 2022 [cited by examiner]
Non-Final Office Action from related U.S. Appl. No. 17/892,030 dated Jun. 22, 2023, pp. 1-105. [cited by applicant]
Non-Final Office Action from related U.S. Appl. No. 17/892,033 dated Jun. 22, 2023, pp. 1-21. [cited by applicant]