US Patent 10885452 Relation graph optimization using inconsistent cycle detection

A first graph is generated from a text data set, with graph nodes representing named entities in the data set and edges representing relationships between the named entities, and with edge weights indicating confidence levels. At least one cycle of the graph may be designated as inconsistent using a rule set. An edge may be selected for deletion from the first graph based on its presence in an inconsistent cycle, the cycle's weight, and/or on the edge weight. A representation of relationships indicated in the modified graph is provided programmatically.