Graphical models for representing text documents for computer analysis
View Patent ↗In a method for representing a text document with a graphical model, a document including a plurality of ordered words is received and a graph data structure for the document is created. The graph data structure includes a plurality of nodes and edges, with each node representing a distinct word in the document and each edge identifying a number of times two nodes occur within a predetermined distance from each other. The graph data structure is stored in an information repository.
1. A method, comprising:
receiving a document including a plurality of ordered words;
creating a graph data structure for the document, wherein the graph data structure includes a plurality of nodes and edges, each node representing a distinct word in the document and each edge identifying a number of times two nodes occur within at least one word from each other;
storing the graph data structure in an information repository;
receiving a request to perform text analysis on the document; and
performing text analysis on the graph data structure and providing a result that is responsive to the request.
2. The method of claim 1 , wherein an edge is a directed edge or an undirected edge.
3. The method of claim 1 , wherein after receiving the document and before creating the graph data structure, the method further comprises pruning stop words from the document, wherein the graph data structure is created from the pruned document.
4. The method of claim 1 , wherein the text analysis is a text search.
5. The method of claim 1 , wherein at least one edge identifies a number of times two nodes occur within two words from each other.
6. A computer program product, comprising:
a computer readable storage medium having computer readable program code embodied therewith, the computer readable program code comprising:
computer readable program code configured to receive a document including a plurality of ordered words; and
computer readable program code configured to create a graph data structure for the document, wherein the graph data structure includes a plurality of nodes and edges, each node representing a distinct word in the document and each edge identifying a number of times two nodes occur within at least one word from each other.
7. The computer program product of claim 6 , wherein an edge is a directed edge or an undirected edge.
8. The computer program product of claim 6 , wherein after receiving the document and before creating the graph data structure, the computer readable program code of the computer readable storage medium further comprises computer readable program code configured to prune stop words from the document, wherein the graph data structure is created from the pruned document.
9. The computer program product of claim 6 , wherein the computer readable program code of the computer readable storage medium further comprises:
computer readable program code configured to receive a request to perform text analysis on the document; and
computer readable program code configured to perform text analysis on the graph data structure to obtain a result that is responsive to the request.