IP Library › Granted Patent US 12,217,007
Granted Patent B2
US 12,217,007 · App. 17/811,763 · Granted Feb 4, 2025

Providing a semantic encoding and language neural network

Inventors: Thanh Lam Hoang (Maynooth, IE); Dzung Phan (Pleasantville, NY); Gabriele Picco (Dublin, IE); Lam Nguyen (Ossining, NY); Marco Luca Sbodio (Castaheany, IE); Vanessa Lopez Garcia (Dublin, IE)
Assignee: INTERNATIONAL BUSINESS MACHINES CORPORATION
G06F40/30G06F40/126G06F40/205G06F40/279G06F40/40G06N3/045G06N3/08
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,217,007
App. No.
17/811,763
Granted
Feb 4, 2025
Kind
B2
Abstract

Embodiments are provided for unsupervised learning of domain specific knowledge graph from textual data and language generation from knowledge graph via reinforcement learning in a computing system by a processor. Unstructured data is automatically parsed into one or more knowledge graphs based on the unstructured data and a list of candidate relations using a first machine learning model. Text data is generated from the one or more knowledge graphs using a second machine learning model.

Claims (49)

1. A method for providing semantic encoding and language generation in a computing system by a processor, comprising:

automatically parsing unstructured data into one or more knowledge graphs based on the unstructured data and a list of candidate relations using a first machine learning model;

encoding, using the first machine learning model, the unstructured data into a distribution of a plurality of triples based on the one or more knowledge graphs, wherein the encoding further comprises predicted probabilities of relations between entities in the unstructured data;

sampling, using a second machine learning model, a set of the plurality of triples from the unstructured data of the one or more knowledge graphs;

generating text data from the set of the plurality of triples using the second machine learning model;

computing a penalty score for the set of the plurality of triples based on a degree of difference between the unstructured data and the generated text data; and

adjusting at least one predicted probability from the first machine learning model based on the determined penalty score.

2. The method of claim 1 , further including training the first machine learning model and the second machine learning model using the unstructured data and the list of candidate relations via unsupervised machine learning, wherein the first machine learning model is a semantic encoder and the second machine learning model is a semantic decoder.

3. The method of claim 1 , further including using the first machine learning model to:

identify the entities in the unstructured data.

4. The method of claim 1 , further including using the second machine learning model to:

decode the set of the plurality of triples into the text data, wherein a triple includes a subject, object, and predicate in the unstructured data, wherein the subject and object are an entity and a predicate is a relation.

5. The method of claim 1 , further including sampling the set of the plurality of triples from the unstructured data of the one or more knowledge graphs for training a plurality of machine learning models via unsupervised machine learning.

6. The method of claim 1 , further including:

identifying one or more candidate entities in the unstructured data; and

using the one or more candidate entities as nodes in the one or more knowledge graphs.

7. A system for providing semantic encoding and language generation in a computing environment, comprising:

one or more computers with executable instructions that when executed cause the system to:

automatically parse unstructured data into one or more knowledge graphs based on the unstructured data and a list of candidate relations using a first machine learning model;

encode, using the first machine learning model, the unstructured data into a distribution of a plurality of triples based on the one or more knowledge graphs, wherein the encoding further comprises predicted probabilities of relations between entities in the unstructured data;

sample, using a second machine learning model, a set of the plurality of triples from the unstructured data of the one or more knowledge graphs;

generate text data from the set of the plurality of triples using the second machine learning model;

compute a penalty score for the set of the plurality of triples based on a degree of difference between the unstructured data and the generated text data; and

adjust at least one predicted probability from the first machine learning model based on the determined penalty score.

8. The system of claim 7 , wherein the executable instructions when executed cause the system to train the first machine learning model and the second machine learning model using the unstructured data and the list of candidate relations via unsupervised machine learning, wherein the first machine learning model is a semantic encoder and the second machine learning model is a semantic decoder.

9. The system of claim 7 , wherein the executable instructions when executed cause the system to use the first machine learning model to:

identify the entities in the unstructured data.

10. The system of claim 7 , wherein the executable instructions when executed cause the system to use the second machine learning model to:

decode the set of the plurality of triples into the text data, wherein a triple includes a subject, object, and predicate in the unstructured data, wherein the subject and object are an entity and a predicate is a relation.

11. The system of claim 7 , wherein the executable instructions when executed cause the system to sample the set of the plurality of triples from the unstructured data of the one or more knowledge graphs for training a plurality of machine learning models via unsupervised machine learning.

12. The system of claim 7 , wherein the executable instructions when executed cause the system to:

identify one or more candidate entities in the unstructured data; and

use the one or more candidate entities as nodes in the one or more knowledge graphs.

13. A computer program product for providing semantic encoding and language generation in a computing environment, the computer program product comprising:

one or more tangible computer readable storage media, and program instructions collectively stored on the one or more tangible computer readable storage media, the program instruction comprising:

automatically parse unstructured data into one or more knowledge graphs based on the unstructured data and a list of candidate relations using a first machine learning model;

encode, using the first machine learning model, the unstructured data into a distribution of a plurality of triples based on the one or more knowledge graphs, wherein the encoding further comprises predicted probabilities of relations between entities in the unstructured data;

sample, using a second machine learning model, a set of the plurality of triples from the unstructured data of the one or more knowledge graphs;

generate text data from the set of the plurality of triples using the second machine learning model;

compute a penalty score for the set of the plurality of triples based on a degree of difference between the unstructured data and the generated text data; and

adjust at least one predicted probability from the first machine learning model based on the determined penalty score.

14. The computer program product of claim 13 , further including program instructions to train the first machine learning model and the second machine learning model using the unstructured data and the list of candidate relations via unsupervised machine learning, wherein the first machine learning model is a semantic encoder and the second machine learning model is a semantic decoder.

15. The computer program product of claim 13 , further including program instructions to use the first machine learning model to:

identify the entities in the unstructured data.

16. The computer program product of claim 13 , further including program instructions to use the second machine learning model to:

decode the set of the plurality of triples into the text data, wherein a triple includes a subject, object, and predicate in the unstructured data, wherein the subject and object are an entity and a predicate is a relation.

17. The computer program product of claim 13 , further including program instructions to:

identify one or more candidate entities in the unstructured data; and

use the one or more candidate entities as nodes in the one or more knowledge graphs.

Assignments (1)
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Jul 11, 2022
From: HOANG, THANH LAM; PHAN, DZUNG TIEN; PICCO, GABRIELE; NGUYEN, LAM MINH; SBODIO, MARCO LUCA; LOPEZ GARCIA, VANESSA
To: INTERNATIONAL BUSINESS MACHINES CORPORATION
Reel/Frame 060476/0454 →
Continuity (1)
Related Publication 20240013003A1 · Jan 11, 2024
References Cited (22)
US 20200250379A1 · Wang · 2020 [cited by applicant]
US 20210279606A1 · Srinivasan · 2021 [cited by examiner]
US 20230351099A1 · Roy · 2023 [cited by examiner]
CN 107526725A · 2017 [cited by applicant]
CN 109101584A · 2018 [cited by applicant]
CN 110275936A · 2019 [cited by applicant]
CN 108427771B · 2020 [cited by applicant]
CN 106980683B · 2021 [cited by applicant]
CN 113065341A · 2021 [cited by applicant]
CN 108197294B · 2021 [cited by applicant]
Cai et al., “AMR Parsing via Graph-Sequence Iterative Inference”, Proceedings of the 58th Annual Meeting of the Association for Computational Linguistics, pp. 1290-1301, Jul. 2020, (12 pages). [cited by applicant]
Cao, Kun, “Unsupervised Construction of Knowledge Graphs From Text and Code”, 15th International Workshop On Mining and Learning with Graphs, arXiv:1908.09354, Aug. 2019 (8 pages). [cited by applicant]
Schmitt et al., “An Unsupervised Joint System for Text Generation from Knowledge Graphs and Semantic Parsing”, Accepted as long paper to EMNLP 2020, arXiv:1904.09447, 2020, (14 pages). [cited by applicant]
Lample et al., “Phrase-Based & Neural Unsupervised Machine Translation”, EMNLP 2018, arXiv:1804.07755, 2018, (14 pages). [cited by applicant]
Niklaus et al., “A Survey on Open Information Extraction”, 27th International Conference on Computational Linguistics, arXiv:1806.05599, 2018, (13 pages). [cited by applicant]
Ribeiro et al., “Investigating Pretrained Language Models for Graph-to-Text Generation”, Accepted as a long paper to NLP4ConvAI, EMNLP2021, arXiv:2007.08426, 2021, (17 pages). [cited by applicant]
Mager et al., “GPT-too: A Language-Model-First Approach for AMR-to-Text Generation”, Proceedings of the 58th Annual Meeting of the Association for Computational Linguistics, Jul. 2020, pp. 1846-1852, (7 pages). [cited by applicant]
Lee et al., “Pushing the Limits of AMR Parsing with Self-Learning”, Findings of the Association for Computational Linguistics: EMNLP 2020, pp. 3208-3214, arXiv:2010.10673, Nov. 2020, (7 pages). [cited by applicant]
Fernandez Astudillo et al., “Transition-based Parsing with Stack-Transformers”, Findings of the Association for Computational Linguistics: EMNLP 2020, pp. 1001-1007, Nov. 2020, (7 pages). [cited by applicant]
Ballesteros et al., “AMR Parsing using Stack-LSTMs”, Proceedings of the 2017 Conference on Empirical Methods In Natural Language Processing, pp. 1269-1275, Sep. 2017, (7 pages). [cited by applicant]
Cai et al., “Core Semantic First: A Top-down Approach for AMR Parsing”, EMNLP2019, arXiv:1909.04303, 2019, (12 pages). [cited by applicant]
Guo et al., “CycleGT: Unsupervised Graph-to-Text and Text-to-Graph Generation via Cycle Training”, INLG 2020 Workshop, arXiv:2006.04702, 2020, (12 pages). [cited by applicant]