| CPC G06F 16/9024 (2019.01) [G06F 16/93 (2019.01)] | 13 Claims |
|
1. A method for generating a dynamic graph network for a plurality of documents in a corpus, the method comprising:
adding, by a processor, a first document into a corpus including a plurality of documents, wherein the plurality of documents have differing origination or modification dates from each other, and wherein the plurality of documents were added to the corpus in a random order;
analyzing, by a processor, a first document among the plurality of documents included in the corpus;
generating, by the processor, a first node for the first document in the dynamic graph network, wherein the dynamic graph network includes a plurality of nodes corresponding to the plurality of documents in the corpus;
extracting, by the processor, one or more values included in the first document;
assigning, by the processor, a key for each of the one or more values included in the first document;
identifying, by the processor, at least one entity for the one or more values extracted from the first document;
generating, by the processor, a second node for the at least one entity in the dynamic graph network;
setting, by the processor, a status identifier for each of the first node and the second node generated;
generating, by the processor, a first edge for the first node and the second node;
establishing, by the processor, a connection between the first node and the second node via the first edge;
adding, by the processor, a second document to the corpus,
wherein the second document is added to the corpus subsequent to the first document, and
wherein the second document is designated to the second node that was generated prior to the second document being added to the corpus;
updating, by the processor, the first document to generate an updated first document;
generating, by the processor, a third node for the updated first document;
severing, by the processor and in response to the updating of the first document, the connection between the first node and the second node established via the first edge;
generating, by the processor, a second edge for the third node and the second node;
establishing, by the processor, a connection between the third node and the second node via the second edge;
updating, by the processor, the status identifier for the second document to reflect an amendment to the first document;
reconciling, by the processor, the first document and the second document, such that the first document and the second document are linked while information included in the first document is bypassed;
receiving, by the processor, a selection of the first node of the dynamic graph network;
checking, by the processor, one or more connections stemming from the first node indicating a delegation to another document;
checking, by the processor, at least one connection of one or more nodes connected to the first node and identifying at least one connection to one or more other nodes that stems from the one or more nodes connected to the first node;
aggregating, by the processor, one or more documents corresponding to the one or more other nodes; and
displaying, by the processor, the aggregated one or more documents to provide a holistic view of the first document.
|