logo

For the Inventor, By the Inventor

The patent badge is an abbreviated version of the USPTO patent document. The patent badge does contain a link to the full patent document.

The patent badge is an abbreviated version of the USPTO patent document. The patent badge covers the following: Patent number, Date patent was issued, Date patent was filed, Title of the patent, Applicant, Inventor, Assignee, Attorney firm, Primary examiner, Assistant examiner, CPCs, and Abstract. The patent badge does contain a link to the full patent document (in Adobe Acrobat format, aka pdf). To download or print any patent click here.

Patent No.:

US 12585877 B1

PDFFull Text
Date of Patent:
Mar. 24, 2026

Filed:

May. 16, 2023

Grouping and linking facts from text to remove ambiguity using knowledge graphs

Applicant:

Nec Laboratories Europe Gmbh, Heidelberg, DE;

Inventors:

Kiril Gashteovski, Heidelberg, DE;

Gorjan Radevski, Heidelberg, DE;

Carolin Lawrence, Heidelberg, DE;

Goran Glavas, Wuerzburg, DE;

Assignee:

NEC CORPORATION, Tokyo, JP;

Attorney:

Leydig, Voit & Mayer, Ltd.

Primary Examiner:

Richa Sonifrank

Int. Cl.
CPC ...
G06F 40/284 (2020.01); G06F 40/20 (2020.01); G06F 40/279 (2020.01); G06F 40/30 (2020.01); G06F 40/40 (2020.01); G06N 3/042 (2023.01); G06N 3/045 (2023.01); G06N 3/048 (2023.01); G06N 3/08 (2023.01); G06N 3/09 (2023.01); G06N 5/02 (2023.01); G06N 5/022 (2023.01); G06N 20/00 (2019.01); G16H 70/40 (2018.01);
U.S. Cl.
CPC ...
G06F 40/284 (2020.01); G06F 40/20 (2020.01); G06F 40/279 (2020.01); G06F 40/30 (2020.01); G06F 40/40 (2020.01); G06N 3/042 (2023.01); G06N 3/045 (2023.01); G06N 3/048 (2023.01); G06N 3/08 (2013.01); G06N 3/09 (2023.01); G06N 5/02 (2013.01); G06N 5/022 (2013.01); G06N 20/00 (2019.01); G16H 70/40 (2018.01);
Abstract

A method for disambiguating textual facts by linking the textual facts to a reference knowledge graph and introducing entities and relations for the textual facts includes ranking the textual facts from textual data. Each of the textual facts is in a triple data structure comprising a subject, a relation, and an object. The method further includes determining whether each element of the triple data structure should be linked to an existing entry within the reference knowledge graph or become a new entry within the data element, and generating an enriched knowledge graph based on the determination. A ranking module using machine learning can be used. The method can help users for decision making and can be used in a variety of applications including, but not limited to, several use cases in drug development, material synthesis, inventory of items, detection of suspects from textual messages, and medical/healthcare.

Find Patent Forward Citations

Gashteovski, Kiril. (2026). Grouping and linking facts from text to remove ambiguity using knowledge graphs (U.S. Patent No. 12585877). U.S. Patent and Trademark Office. https://idiyas.com/patent/badge/12585877

Data source: USPTO (United States Patent and Trademark Office) public patent records. Weekly synchronization. How IDiyas builds this profile

Loading…