Abstract: A system and method for determining a spatial arrangement of thematically-related clusters is provided. A convex cluster is selected from a set of convex clusters, which each include shared concepts and terms. A center of mass is determined for the selected convex cluster, which is placed along a vector. An anchor point including at least one open edge formed on the selected convex cluster at an intersection of the vector defined from the center of mass and an edge of the selected convex cluster is located. One or more of the remaining convex clusters in the convex clusters set is selected. The one or more remaining convex clusters are arranged with a center of mass originating outside of the anchor point and on the vector of the selected convex cluster. Overlap of the arranged convex clusters is limited. The arranged convex clusters are displayed.

Abstract: A system and method for providing efficient document scoring of concepts within a document set is described. A frequency of occurrence of at least one concept within a document retrieved from the document set is determined. A concept weight is analyzed reflecting a specificity of meaning for the at least one concept within the document. A structural weight is analyzed reflecting a degree of significance based on structural location within the document for the at least one concept. A corpus weight is analyzed inversely weighing a reference count of occurrences for the at least one concept within the document. A score associated with the at least one concept is evaluated as a function of the frequency, concept weight, structural weight, and corpus weight.

Abstract: Electronic data files are broadly characterized as “messages” and a social network is constructed by analyzing one or more messages exchanged between various entities. Additionally, messages from structured and/or unstructured data stores are correlated using one or more common/related data elements from two or more messages. Further, the social network and the concepts contained in the exchanged messages (i.e. semantic network) can be visualized using a series of multi-aspect viewing tools. Finally, in conjunction with the social network and the semantic network, a message network based on the chronological relationship of the messages (event network) can be constructed to analyze and visualize how the messages relate to each other in a time-based reference model. Once visualized, the relationship of the concepts contained in the messages as well as the relationship between the entities and the timing involved in the exchange of messages can be analyzed for desired information.

Abstract: A system and method for identifying messages in a message store is provided. At least part of metadata associated with and at least part of content contained in each of a plurality of messages in a message store are encoded by generating a metadata sequence and a content sequence for each message. The messages are grouped into sets by similar metadata sequences and similar content sequences. The messages in each set are compared. Each such message not matching any other such message in the set is marked as a unique message. Each such message matching at least one other such message in the set is marked as an exact duplicate message. Each such message including a subset of at least one other such message in the set is marked as a near duplicate message.

Abstract: A table of clauses is compiled into a shareable database. Each clause relates to parties potentially affected by a use of the clause in a legal document. Each clause also includes authorizations controlling access and preferences specifying provisions and terms for a specific subject matter. A searchable index is formed using a topical ordering based on the specific subject matter included. A clause selection interface is exported and includes document drafting controls. The clauses table index is authenticated against the authorizations for a given user, preferences for the individual parties, and specified monetary amount and is presented following successful authentication. A clause selection is authenticated against the authorizations for a given user and the preferences for the parties. An individual clause from the clauses table is displayed on the user interface upon the selection by the given user following successful authentication.

Abstract: A set of clusters is selected from a concept space including clusters with concepts extracted to visualize document content. A theme is identified in each of the clusters. Each theme includes a concept ranked within the cluster. Unique candidate spines including clusters sharing at least one common theme are logically formed. The clusters are assigned to one such candidate spine having a substantially best fit. Each best fit candidate spine sufficiently unique from each other such best fit candidate spine is identified. The identified best fit candidate spine is placed in a visual display space. A similarity between each non-identified best fit candidate spine and each placed best fit candidate spine is evaluated. Each non-identified best fit candidate spine is placed in the visual display space relative to an anchor cluster on the placed best fit candidate spine that is sufficiently similar to the non-identified best fit candidate spine.

Abstract: A system and method for providing a dynamic user interface for a dense three-dimensional scene is presented. Clusters are placed in a three-dimensional scene arranged proximal to each other such cluster to form a cluster spine. Each cluster includes one or more concepts. Each cluster spine is projected into a two-dimensional display relative to a stationary perspective as a hierarchical view of the cluster spines in the display. Folder controls operating on the hierarchical view are presented. The hierarchical view includes an indicator representing each cluster spine and a line indicating the cluster spine interrelationships relative to other cluster spines. A label is generated to identify one such concept included in each cluster spine in the hierarchical view.

Abstract: A system and method for providing a dynamic user interface for a dense three-dimensional scene is presented. Clusters are placed in a three-dimensional scene arranged proximal to each other such cluster to form a cluster spine. Each cluster includes one or more concepts. Each cluster spine is projected into a two-dimensional display relative to a stationary perspective. Controls operating on a view of the cluster spines in the display are presented. A compass logically framing the cluster spines within the display is provided. A label to identify one such concept in one or more of the cluster spines appearing within the compass is generated. A plurality of slots in the two-dimensional display positioned circumferentially around the compass is defined. Each label is assigned to the slot outside of the compass for the cluster spine having a closest angularity to the slot.

Abstract: A system and method for providing a perspective-corrected representation of a multi-dimensional cluster is presented. Clusters are displayed based on independent spatial orientations within multiple dimensions. For each such spatial orientation, the clusters are located at an independent distance from a common origin. A relationship between a pair of the clusters is picked and analyzed. A criteria for perspective correction is sought. The criteria is applied to the pair of clusters to determine whether the clusters need be reoriented. The clusters are reoriented in the display by a perspective-corrected distance based on the relationship between the pair of clusters.

Abstract: A system and method for arranging clusters in a display by theme. Themes are found within a plurality of clusters. There are one or more concepts per theme and one or more documents per cluster. Those clusters that meet a best fit criteria are assigned by theme into a set of spines with no more than one spine formed per theme. Those spines that are unique from the other spines are retained in the set. The spines that were retained in the set are arranged in a display.

Abstract: A system and method for dynamically evaluating latent concepts in unstructured documents is disclosed. A multiplicity of concepts are extracted from a set of unstructured documents into a lexicon. The lexicon uniquely identifies each concept and a frequency of occurrence. A frequency of occurrence representation is created for the documents set. The frequency representation provides an ordered corpus of the frequencies of occurrence of each concept. A subset of concepts is selected from the frequency of occurrence representation filtered against a pre-defined threshold. A group of weighted clusters of concepts selected from the concepts subset is generated. A matrix of best fit approximations is determined for each document weighted against each group of weighted clusters of concepts.

Abstract: A system and method for arranging concept clusters in thematic relationship in a two-dimensional visual display space is described. A plurality of stored clusters are selected from a multi-dimensional visualization space sharing a common theme including at least one concept. Each theme logically represents one or more concepts based on terms extracted from a document set. Each cluster not yet grouped from the selected clusters for the shared common theme is combined in order into a list of placeable clusters. Each clusters list is grafted into a grouping of one or more other clusters lists at an anchor point. The anchor point includes an open edge formed along a vector defined from the center of one such cluster in the grouping. The clusters in each other clusters list share at least one concept represented in the shared common theme.

Abstract: A system and method for arranging concept clusters in thematic neighborhood relationships in a two-dimensional visual display space is presented. A set of clusters is selected from a concept space. The concept space includes a multiplicity of clusters with concepts visualizing document content based on extracted concepts. A theme in each of a plurality of the clusters is identified. Each theme includes at least one such concept ranked within the cluster. A plurality of unique candidate spines is logically formed. Each candidate spine includes clusters commonly sharing at least one such concept. The clusters are assigned to one such candidate spine having a substantially best fit. Each such sufficiently unique best fit candidate spine is identified and placed in a visual display space. Each non-identified best fit candidate spine is placed in the visual display space relative to an anchor cluster on one such identified best fit candidate spine.

Abstract: A system and a method for efficiently drafting a legal document using an authenticated clause table are described. A table of clauses is compiled into a shareable database. Each clause relates to one or more individual parties potentially affected by a use of the clause in a legal document. Each clause also includes authorizations controlling access and preferences specifying provisions and terms for a specific subject matter. A searchable index of the clauses table is formed using a topical ordering based on the specific subject matter included in the provisions and terms of each clause. A clause selection interface is exported and includes document drafting controls. The clauses table index is authenticated against the authorizations for a given user and the preferences for the individual parties and specified monetary amount and is presented on the user interface following successful authentication.

Abstract: A system and method for evaluating a structured message store for message redundancy is described. A header and a message body are extracted from each of a plurality of messages maintained in a structured message store. A substantially unique hash code is calculated over at least part of the header and over the message body of each message. The messages are grouped by the hash codes. One such message is identified as a unique message within each group. In a further embodiment, the messages are grouped by conversation thread. The message body for each message within each conversation thread group is compared. At least one such message within each conversation thread group is identified as a unique message.

Abstract: A system and method for dynamically evaluating latent concepts in unstructured documents is disclosed. A multiplicity of concepts are extracted from a set of unstructured documents into a lexicon. The lexicon uniquely identifies each concept and a frequency of occurrence. A frequency of occurrence representation is created for the documents set. The frequency representation provides an ordered corpus of the frequencies of occurrence of each concept. A subset of concepts is selected from the frequency of occurrence representation filtered against a pre-defined threshold. A group of weighted clusters of concepts selected from the concepts subset is generated. A matrix of best fit approximations is determined for each document weighted against each group of weighted clusters of concepts.

Abstract: A system and method for generating a visualized data representation preserving independent variable geometric relationships is described. A pair of convex clusters are selected. Each convex cluster is rendered on a display. Each convex cluster has a center of mass located at an original fixed distance from a common origin, and is oriented along a vector formed at a fixed angle from a common polar axis. A span is measured between the centers of mass of each convex cluster. For each convex cluster, a segment is measured from the center of mass of each convex shape to a point closest to the other convex shape along the span. A new fixed distance from the common origin for the center of mass for one of the convex clusters located along the vector for that convex cluster is evaluated if the span is less than the sum of the segments of the convex clusters. The pair of convex clusters are displayed rendered using at least the new fixed distance for the center of mass of the one convex cluster.

Abstract: A system and method for evaluating a structured message store for message redundancy is described. A header and a message body are extracted from each of a plurality of messages maintained in a structured message store. A substantially unique hash code is calculated over at least part of the header and over the message body of each message. The messages are grouped by the hash codes. One such message is identified as a unique message within each group. In a further embodiment, the messages are grouped by conversation thread. The message body for each message within each conversation thread group is compared. At least one such message within each conversation thread group is identified as a unique message.

Abstract: A system and method for efficiently generating cluster groupings in a multi-dimensional concept space is described. A plurality of terms are extracted from each document in a collection of stored unstructured documents. A concept space is built over the document collection. Terms substantially correlated between a plurality of documents within the document collection are identified. Each correlated term is expressed as a vector mapped along an angle &thgr; originating from a common axis in the concept space. A difference between the angle &thgr; for each document and an angle &sgr; for each cluster within the concept space is determined. Each such cluster is populated with those documents having such difference between the angle &thgr; for each such document and the angle &sgr; for each such cluster falling within a predetermined variance.