| CPC G06F 40/194 (2020.01) [G06F 40/295 (2020.01); G06T 11/206 (2013.01)] | 22 Claims |

|
1. A computer-implemented method for identifying and visualizing differences between a first set comprising one or more text items and a second set comprising one or more text items, the method comprising:
extracting a collection of named entities from the first and second sets of one or more text items;
generating a composite graph structure from the collection of named entities, the composite graph structure including differences between the first and second sets of one or more text items, wherein generating the composite graph structure comprises:
assigning a node to each named entity from the collection of named entities;
establishing relationships between pairs of nodes including defining edges between those pairs of nodes where a relationship has been established;
establishing one or more groups of nodes based on the nodes assigned to each named entity, wherein the one or more groups of nodes includes a first group of nodes corresponding to named entities exclusively from the first set of one or more text items, a second group of nodes corresponding to named entities exclusively from the second set of one or more text items, and a third group of nodes corresponding to named entities from both the first and second sets of one or more text items;
assigning a node spatial location to each of the nodes for displaying the differences between the first and second sets of one or more text items, wherein assigning the node spatial location includes determining the node spatial location in accordance with a force-directed model and wherein the node having an associated geographical location is subject to an initial overriding constraint that the associated determined node spatial location is representative of the geographical location; and
in response to assigning the node spatial location, displaying spatially the composite graph structure, wherein each of the assigned node spatial locations is displayed according to a constraint, and wherein the constraint is such that connected pairs of nodes in the same group are connected by edges having an intragroup edge length which is less than an intergroup edge length that connects different groups of nodes.
|