Graphical representation of frame instances
View Patent ↗The following graphical representations, of frame instance data, are presented: Instance Graph and Instance Plot. An Instance Graph is a kind of directed graph that represents directed relationships between items, as established by frame instances. An example frame is the Preference Frame, as applied to online opinion data. The degree or “influence” of a node can be graphically indicated. Multiple edges, between two nodes, can be represented as a compound edge. Each node can be modeled as having a field, causing it to repel all other nodes, which each edge can be modeled as producing an attractive force. The “net preference” of a node is the difference between its outdegree and indegree. From the “influence” and “net preference” values, for nodes of an Instance Graph, an Instance Plot can be produced. One axis of an instance plot is based on “influence” and another axis is based on “net preference.”
1. A method for graphically presenting frame instance data, comprising:
determining, as a result of computing hardware and programmable memory, a first set of logical forms, each logical form representative of a corresponding unit of natural language in a first source of computer-accessible content, wherein at least some logical forms, of the first set of logical forms, include representation of a logical verb, a logical subject, and a logical object;
producing an instance of a frame, as a result of computing hardware and programmable memory, each time a frame extraction rule is satisfied by a member of the first set of logical forms, wherein each instance produced is added to a first set of frame instances;
producing, performed at least in part with a configuration of computing hardware and programmable memory, a first graph, inclusive of directed edges, by representing each member, of the first set of frame instances, by a directed edge between two nodes;
merging, performed at least in part with a configuration of computing hardware and programmable memory, a first node and a second node if a first role value, represented by the first node, is sufficiently similar to a second role value, represented by the second node;
determining, performed at least in part with a configuration of computing hardware and programmable memory, for each node, an outdegree, indegree and degree;
determining, performed at least in part with a configuration of computing hardware and programmable memory, for each node, a preference as a function of outdegree and indegree; and
displaying, performed at least in part with a configuration of computing hardware and programmable memory, each node, in a coordinate system, using its degree and preference.
2. The method of claim 1 , wherein determining the preference includes, at least, subtraction of the indegree from the outdegree.
3. The method of claim 1 , wherein the coordinate system is Cartesian, using one axis for degree and another for preference.
4. A data processing system, comprising:
one or more processors and programmable memory, wherein the system is configured:
to accomplish determining a first set of logical forms, each logical form representative of a corresponding unit of natural language in a first source of computer-accessible content, wherein at least some logical forms, of the first set of logical forms, include representation of a logical verb, a logical subject, and a logical object;
to accomplish producing an instance of a frame each time a frame extraction rule is satisfied by a member of the first set of logical forms, wherein each instance produced is added to a first set of frame instances;
to accomplish producing a first graph, inclusive of directed edges, by representing each member, of the first set of frame instances, by a directed edge between two nodes;
to accomplish merging a first node and a second node if a first role value, represented by the first node, is sufficiently similar to a second role value, represented by the second node; and
to accomplish determining, for each node, an outdegree, indegree and degree;
to accomplish determining, for each node, a preference as a function of outdegree and indegree; and
to accomplish displaying, each node, in a coordinate system, using its degree and preference.
5. The system of claim 4 , wherein determining the preference includes, at least, subtraction of the indegree from the outdegree.
6. The system of claim 4 , wherein the coordinate system is Cartesian, using one axis for degree and another for preference.