Graphical representation of frame instances and co-occurrences

1. A method for graphically presenting data, comprising:

identifying in a first corpus that includes natural language, as a result of a configuration of computing hardware and programmable memory, a first set of occurrences of a first item, wherein the first item is a first brand of products;

identifying in the first corpus, as a result of a configuration of computing hardware and programmable memory, a second set of occurrences of a second item, wherein the second item is a second brand of products, and;

identifying in the first corpus, as a result of a configuration of computing hardware and programmable memory, a third set of occurrences of a third item, wherein the third item is a third brand of products, and each of the first, second and third brands is in competition with the other two brands;

identifying, as a result of a configuration of computing hardware and programmable memory, a first set of co-occurrences of the first and second items, where each co-occurrence indicates both the second and third items occurring within a common unit of natural language;

identifying, as a result of a configuration of computing hardware and programmable memory, a second set of co-occurrences of the second and third items, where each co-occurrence indicates both the second and third items occurring within a common unit of natural language;

graphically displaying a first node, as a result of a configuration of computing hardware and programmable memory, in a way that is representative of the first set of occurrences;

graphically displaying a second node, as a result of a configuration of computing hardware and programmable memory, in a way that is representative of the second set of occurrences;

graphically displaying a third node, as a result of a configuration of computing hardware and programmable memory, in a way that is representative of the third set of occurrences;

graphically displaying a first edge, as a result of a configuration of computing hardware and programmable memory, connective of the first and second nodes, in a way that is representative of the first set of co-occurrences;

graphically displaying a second edge, as a result of a configuration of computing hardware and programmable memory, connective of the second and third nodes, in a way that is representative of the second set of co-occurrences;

determining a first occurrence number, equal to a number of occurrences in the first set of occurrences;

determining a second occurrence number, equal to a number of occurrences in the second set of occurrences;

determining a third occurrence number, equal to a number of occurrences in the third set of occurrences;

determining a first co-occurrence number, equal to a number of co-occurrences in the first set of co-occurrences;

determining a second co-occurrence number, equal to a number of co-occurrences in the second set of co-occurrences;

graphically displaying the first edge as both a first directional edge, from the first node to the second node, and as a second directional edge, from the second node to the first node;

graphically displaying the first directional edge, as a function of a first ratio of the first co-occurrences number divided by the first occurrences number;

graphically displaying the second directional edge, as a function of a second ratio of the first co-occurrences number divided by the second occurrences number;

graphically displaying the second edge as both a third directional edge, from the second node to the third node, and as a fourth directional edge, from the third node to the second node;

graphically displaying the third directional edge, as a function of a third ratio of the second co-occurrences number divided by the second occurrences number;

graphically displaying the fourth directional edge, as a function of a fourth ratio of the second co-occurrences number divided by the third occurrences number;

simulating the first, second, third, and fourth directional edges as each producing, between its pair of nodes, an attractive force that is a function of, respectively, the first, second, third, and fourth ratios; and

simulating the first, second, and third nodes as each producing a force that causes each node to repel all other nodes.

2. The method of claim 1 , further comprising:

graphically displaying the first node, in a way that relies upon a first node function, and the first node function has, as an input, the first occurrence number;

graphically displaying the second node, in a way that relies upon a second node function, and the second node function has, as an input, the second occurrence number;

graphically displaying the third node, in a way that relies upon a third node function, and the third node function has, as an input, the third occurrence number;

graphically displaying the first edge, in a way that relies upon a first edge function, and the first edge function has, as an input, the first co-occurrence number;

graphically displaying the second edge, in a way that relies upon a second edge function, and the second edge function has, as an input, the second co-occurrence number.

3. The method of claim 2 , further comprising:

displaying the first node with a radius that is dependent upon the first node function.

4. The method of claim 3 , further comprising:

determining, by the first node function, a log of the first occurrence number.

5. The method of claim 3 , further comprising:

determining, by the first node function, a scaled value of the first occurrence number.

6. The method of claim 2 , further comprising:

displaying the first edge with a thickness that is dependent upon the first edge function.

7. The method of claim 6 , further comprising:

determining, by the first edge function, a log of the first co-occurrence number.

8. The method of claim 6 , further comprising:

determining, by the first edge function, a scaled value of the first co-occurrence number.

9. The method of claim 1 , further comprising:

selecting the first node of a first graph;

determining a first edge set, containing those edges directly connected to the first node;

determining a first node set, containing those nodes directly connected to the first edge set;

graphically emphasizing, with respect to any remaining portion of the first graph, the first node, the first node set, and the first edge set.

10. The method of claim 1 , further comprising:

determining a first set of units of natural language, wherein each element of the set is a unit of natural language in which the first item occurs;

determining a first sub-set of the first set of units of natural language, wherein each element of the sub-set has an instance, triggered by its unit of natural language, and the instance describes a first property of the first item as having a value;

determining a first net value, of the first property of the first item, from the values of the first sub-set;

mapping the first net value to a graphical representation and displaying the first node in accordance with the graphical representation.

11. The method of claim 1 , further comprising:

determining a first set of units of natural language, wherein each element of the first set is a unit of natural language in which the first item occurs;

determining, for each element of the first set of units of natural language, its value in accordance with a certain first demographic;

determining a first net demographic value, in accordance with the values assigned for the first set of units of natural language;

mapping the first net demographic value to a graphical representation and displaying the first node in accordance with the graphical representation.