Filtering spurious knowledge graph relationships between labeled entities

A computer-implemented method, comprising:

• generating, by a device operatively coupled to a processor, a context-based embedding of one or more first terms in a document collection, thereby yielding vector representations of the one or more first terms, wherein the one or more first terms correspond to knowledge terms in one or more first nodes of a knowledge graph;
• determining, by the device, that at least two of the one or more first terms that have vector representations that have a similarity value that meets a defined criterion have a hypernymy relation between them, and determine that at least two of the one or more first terms that have vector representations that fail to have a similarity value that meets the defined criterion do not have a hypernymy relation between them, wherein the vector representations are compared to determine whether the hypernymy relation from the knowledge graph for the at least two of the one or more first terms is spurious;
• and
• filtering out, by the device, a relationship between the one or more first nodes and a second node of the knowledge graph based on the similarity value.

A computer program product for facilitating spurious relationship filtration, the computer program product comprising a computer readable storage medium having program instructions embodied therewith, the program instructions executable by a processing component to cause the processing component to:

• generate a context-based embedding of one or more first terms in a document collection, thereby yielding vector representations of the one or more first terms, wherein the one or more first terms correspond to knowledge terms in one or more first nodes of a knowledge graph;
• determine that at least two of the one or more first terms that have vector representations that have a similarity value that meets a defined criterion have a supplier relation between them, and determine that at least two of the one or more first terms that have vector representations that fail to have a similarity value that meets the defined criterion do not have a supplier relation between them, wherein the vector representations are compared to determine whether the supplier relation from the knowledge graph for the at least two of the one or more first terms is spurious;
• and
• filter out a relationship between the one or more first nodes and a second node of the knowledge graph based on the similarity value.