Methods and systems for visualizing topic location in a document redundancy graph
First Claim
1. A method for visualizing topic location in a document redundancy graph, said method comprising:
- constructing a document redundancy graph by 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 represents a unique duster of information, analyzing said plurality of nodes for redundant information by comparing paragraph identifiers for each of said at least one paragraph to obtain a probability value for each pair of paragraphs, and merging certain of said plurality of nodes based on said probability value;
providing data representing said document redundancy graph for a document or document set;
determining user interface specified search data;
searching for said search data in document subcomponents of said document or document set;
determining at least one of said document subcomponents containing data related to search data;
determining, from said redundancy graph data, user selectable node(s) containing said determined document subcomponent(s); and
generating data for identifying said determined user selectable node(s) on a user interface.
2 Assignments
0 Petitions
Accused Products
Abstract
Methods, systems, and computer program products can visualize topic location in a document redundancy graph. Document subcomponents such as, for example, document paragraphs of a document or document set can be searched for user interface specified search data and a determination can be made as to which document subcomponents contain information relating to the search data. Based on the redundancy graph data, a determination can then be made as to which particular user selectable node(s) of the graph contain the particular document subcomponent(s). Data for identifying the determined particular user selectable node(s) on a user interface can be generated and rendered to allow a user to quickly locate the particular user selectable node(s) on the redundancy graph. The particular user selectable nodes themselves can for example be visually highlighted on the graph. Keyword indexing can be used to assure chosen keywords are keywords relating to particular topics contained in the document set.
-
Citations
20 Claims
-
1. A method for visualizing topic location in a document redundancy graph, said method comprising:
-
constructing a document redundancy graph by 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 represents a unique duster of information, analyzing said plurality of nodes for redundant information by comparing paragraph identifiers for each of said at least one paragraph to obtain a probability value for each pair of paragraphs, and merging certain of said plurality of nodes based on said probability value; providing data representing said document redundancy graph for a document or document set; determining user interface specified search data; searching for said search data in document subcomponents of said document or document set; determining at least one of said document subcomponents containing data related to search data; determining, from said redundancy graph data, user selectable node(s) containing said determined document subcomponent(s); and generating data for identifying said determined user selectable node(s) on a user interface. - View Dependent Claims (2, 3, 4, 5, 6, 7, 8, 9)
-
-
10. A system for visualizing a topic location in 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 to; construct a document redundancy graph by 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 represents a unique duster of information, analyzing said plurality of nodes for redundant information by comparing paragraph identifiers for each of said at least one paragraph to obtain a probability value for each pair of paragraphs, and merging certain of said plurality of nodes based on said probability value; provide data representing a document redundancy graph for a document or document set; determine a user interface specified search data; search for said search data in document subcomponents of said document or document set; determine at least one of said document subcomponents containing data related to search data; determine, from said redundancy graph, data user selectable node(s) containing said determined document subcomponent(s); and generate data for identifying said determined user selectable node(s) on a user interface. - View Dependent Claims (11, 12, 13, 14, 15)
-
-
16. A computer program product comprising:
- a non-transitory computer-usable data carrier storing instructions that, when executed by a computer, cause the computer to perform a method for visualizing topic location on a redundancy graph, the method comprising;
constructing a document redundancy graph by 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 represents a unique cluster of information, analyzing said plurality of nodes for redundant information by comparing paragraph identifiers for each of said at least one paragraph to obtain a probability value for each pair of paragraphs, and merging certain of said plurality of nodes based on said probability value; providing data representing a document redundancy graph for a document or document set; determining user interface specified search data; searching for said search data in document subcomponents of said document or document set; determining at least one of said document subcomponents containing data related to search data; determining, from said redundancy graph, data user selectable node(s) containing said determined document subcomponent(s); and generating data for identifying said determined user selectable node(s) on a user interface. - View Dependent Claims (17, 18, 19, 20)
- a non-transitory computer-usable data carrier storing instructions that, when executed by a computer, cause the computer to perform a method for visualizing topic location on a redundancy graph, the method comprising;
Specification