METHOD AND SYSTEM FOR CONSTRUCTING A DOCUMENT REDUNDANCY GRAPH
First Claim
1. A method for constructing a document redundancy graph, said method comprising:
- representing at least one paragraph associated with a document set as a node among a plurality of nodes, wherein each node among said plurality of nodes with respect to said redundancy graph represents a unique cluster of information;
merging said plurality of nodes associated with redundant information by configuring a data structure with respect to a pair of information identifiers in association with a probability value, wherein said probability value sorts a plurality of information matches in an order of decreasing certainty; and
combining said plurality of nodes unique to a single document by comparing each information identifier among said pair of information identifiers to an entry in said data structure in an order wherein said data structure eliminates inconsistency associated with said plurality of information matches.
7 Assignments
0 Petitions
Accused Products
Abstract
A system and method for constructing a document redundancy graph with respect to a document set. The redundancy graph can be constructed with a node for each paragraph associated with the document set such that each node in the redundancy graph represents a unique cluster of information. The nodes can be linked in an order with respect to the information provided in the document set and bundles of redundant information from the document set can be mapped to individual nodes. A data structure (e.g., a hash table) of a paragraph identifier associated with a probability value can be constructed for eliminating inconsistencies with respect to node redundancy. Additionally, a sequence of unique nodes can also be integrated into the graph construction process. The nodes can be connected to the paragraphs associated with the document set via a hyperlink and/or via a label with respect to each node.
-
Citations
20 Claims
-
1. A method for constructing a document redundancy graph, said method comprising:
-
representing at least one paragraph associated with a document set as a node among a plurality of nodes, wherein each node among said plurality of nodes with respect to said redundancy graph represents a unique cluster of information; merging said plurality of nodes associated with redundant information by configuring a data structure with respect to a pair of information identifiers in association with a probability value, wherein said probability value sorts a plurality of information matches in an order of decreasing certainty; and combining said plurality of nodes unique to a single document by comparing each information identifier among said pair of information identifiers to an entry in said data structure in an order wherein said data structure eliminates inconsistency associated with said plurality of information matches. - View Dependent Claims (2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12)
-
-
13. A method for navigating information in a document set, said method comprising:
-
constructing a document redundancy graph for said document set wherein matching information elements across documents associated with said document are combined into single nodes; presenting said document redundancy graph to a user; and permitting said user to access information regarding information elements associated with at least one node of said document redundancy graph.
-
-
14. A system for constructing a document redundancy graph, said system comprising:
-
a processor; a data bus coupled to said processor; and a computer-usable medium embodying computer code, said computer-usable medium being coupled to said data bus, said computer program code comprising instructions executable by said processor and configured for; representing at least one paragraph associated with a document set as a node among a plurality of nodes, wherein each node among said plurality of nodes with respect to said redundancy graph represents a unique cluster of information; merging said plurality of nodes associated with redundant information by configuring a data structure with respect to a pair of information identifiers in association with a probability value, wherein said probability value sorts a plurality of information matches in an order of decreasing certainty; and combining said plurality of nodes unique to a single document by comparing each information identifier among said pair of information identifiers to an entry in said data structure in an order wherein said data structure eliminates inconsistency associated with said plurality of information matches. - View Dependent Claims (15, 16, 17, 18, 19, 20)
-
Specification