# US 2022/0036009 A1 · Semantic linkage qualification of ontologically related entities > Agents: this data is available as JSON from the patentgrep API and MCP server — see https://patentgrep.com/llms.txt - Number: US 2022/0036009 A1 - Document ID: US20220036009A1 - Status: Published application - Kind: A1 - Application number: 16/940,625 - Filed: 2020-07-28 - Published: 2022-02-03 - Earliest claimed: 2020-07-28 - Assignees: International Business Machines Corporation - Applicants: International Business Machines Corporation - Inventors: Scott Carrier; Jennifer Lynn La Rocca; Rebecca Lynn Dahlman; Mario J. Lorenzo - Web page: https://patentgrep.com/patent/US20220036009A1 ## CPC - G06F 40/30: Semantic analysis - G06F 40/205: Parsing - G06F 40/237: Lexical tools - G06F 40/279: Recognition of textual entities - G06F 40/295: Named entity recognition - G06N 5/02: Knowledge representation; Symbolic representation - G06N 5/022: Knowledge engineering; Knowledge acquisition - G06N 20/10: using kernel methods, e.g. support vector machines [SVM] - G06N 3/088: Non-supervised learning, e.g. competitive learning - G06F: ELECTRIC DIGITAL DATA PROCESSING (computer systems based on specific computational models G06N) - G06N: COMPUTING ARRANGEMENTS BASED ON SPECIFIC COMPUTATIONAL MODELS ## Abstract Aspects of the present disclosure include determining, by a processor, an ontology, the ontology comprising a plurality of ontological relationships, receiving, by the processor, a plurality of passages, determining, by the processor, a target set of co-occurring entities comprising a first entity and a second entity, determining a first passage in the plurality of passages that includes the first entity and the second entity, determining, from the ontology, a first ontological relationship between the first entity and the second entity, analyzing the first passage to determine a congruency score for the first ontological relationship, and generating a relationship annotation between the first entity and the second entity in the first passages based on the congruency score being within a threshold. ## Claims ### Claim 1 A computer-implemented method comprising: determining, by a processor, an ontology, the ontology comprising a plurality of ontological relationships; receiving, by the processor, a plurality of passages; determining, by the processor, a target set of co-occurring entities comprising a first entity and a second entity; determining a first passage in the plurality of passages that includes the first entity and the second entity; determining, from the ontology, a first ontological relationship between the first entity and the second entity; analyzing the first passage to determine a congruency score for the first ontological relationship; and generating a relationship annotation between the first entity and the second entity in the first passages based on the congruency score being within a threshold. ### Claim 2 (depends on 1) The computer-implemented method of claim 1, wherein analyzing the first passage to determine the congruency score for the first ontological relationship comprises: generating a graph of the first passage, the graph comprising a plurality of nodes representing a plurality of words and phrases in the first passage; and analyzing a semantic linkage between the plurality of nodes and the first ontological relationship to determine the congruency score. ### Claim 3 (depends on 2) The computer-implemented method of claim 2, wherein analyzing the semantic linkage between the plurality of nodes and the first ontological relationship to determine the congruency score comprises: generating, by the processor utilizing a word embedding model, a word vector for each node in the plurality of node, the word vector comprising a plurality of features associated with the node; and comparing the word vector to a vector representation of the first ontological relationship to determine the congruency score. ### Claim 4 (depends on 3) The computer-implemented method of claim 3, wherein the congruency score comprises a geometric distance between the word vector plotted in a geometric space and the vector representation of the first ontological relationship plotted in the geometric space. ### Claim 5 (depends on 2) The computer-implemented method of claim 2, wherein the graph comprises a parse tree. ### Claim 6 (depends on 1) The computer-implemented method of claim 1, wherein the threshold is determined by a user input. ### Claim 7 (depends on 1) The computer-implemented method of claim 1, wherein the passage comprises a sentence. ### Claim 8 A system comprising: a processor communicatively coupled to a memory, the processor configured to: determine an ontology, the ontology comprising a plurality of ontological relationships; receive a plurality of passages; determine a target set of co-occurring entities comprising a first entity and a second entity; determine a first passage in the plurality of passages that includes the first entity and the second entity; determine, from the ontology, a first ontological relationship between the first entity and the second entity; analyze the first passage to determine a congruency score for the first ontological relationship; and generate a relationship annotation between the first entity and the second entity in the first passages based on the congruency score being within a threshold. ### Claim 9 (depends on 8) The system of claim 8, wherein analyzing the first passage to determine the congruency score for the first ontological relationship comprises: generating a graph of the first passage, the graph comprising a plurality of nodes representing a plurality of words and phrases in the first passage; and analyzing a semantic linkage between the plurality of nodes and the first ontological relationship to determine the congruency score. ### Claim 10 (depends on 9) The system of claim 9, wherein analyzing the semantic linkage between the plurality of nodes and the first ontological relationship to determine the congruency score comprises: generating, by the processor utilizing a word embedding model, a word vector for each node in the plurality of node, the word vector comprising a plurality of features associated with the node; and comparing the word vector to a vector representation of the first ontological relationship to determine the congruency score. ### Claim 11 (depends on 10) The system of claim 10, wherein the congruency score comprises a geometric distance between the word vector plotted in a geometric space and the vector representation of the first ontological relationship plotted in the geometric space. ### Claim 12 (depends on 9) The system of claim 9, wherein the graph comprises a parse tree. ### Claim 13 (depends on 8) The system of claim 8, wherein the threshold is determined by a user input. ### Claim 14 (depends on 8) The system of claim 8, wherein the passage comprises a sentence. ### Claim 15 A computer program product comprising a computer readable storage medium having program instructions embodied therewith, the program instructions executable by a processor to cause the processor to perform a method comprising: determining, by the processor, an ontology, the ontology comprising a plurality of ontological relationships; receiving, by the processor, a plurality of passages; determining, by the processor, a target set of co-occurring entities comprising a first entity and a second entity; determining a first passage in the plurality of passages that includes the first entity and the second entity; determining, from the ontology, a first ontological relationship between the first entity and the second entity; analyzing the first passage to determine a congruency score for the first ontological relationship; and generating a relationship annotation between the first entity and the second entity in the first passages based on the congruency score being within a threshold. ### Claim 16 (depends on 15) The computer program product of claim 15, wherein analyzing the first passage to determine the congruency score for the first ontological relationship comprises: generating a graph of the first passage, the graph comprising a plurality of nodes representing a plurality of words and phrases in the first passage; and analyzing a semantic linkage between the plurality of nodes and the first ontological relationship to determine the congruency score. ### Claim 17 (depends on 16) The computer program product of claim 16, wherein analyzing the semantic linkage between the plurality of nodes and the first ontological relationship to determine the congruency score comprises: generating, by the processor utilizing a word embedding model, a word vector for each node in the plurality of nodes, the word vector comprising a plurality of features associated with the node; and comparing the word vector to a vector representation of the first ontological relationship to determine the congruency score. ### Claim 18 (depends on 17) The computer program product of claim 17, wherein the congruency score comprises a geometric distance between the word vector plotted in a geometric space and the vector representation of the first ontological relationship plotted in the geometric space. ### Claim 19 (depends on 16) The computer program product of claim 16, wherein the graph comprises a parse tree. ### Claim 20 (depends on 15) The computer program product of claim 15, wherein the passage comprises a sentence.