Abstract: Disclosed is a system for, and method of, determining whether records and entity representations should be delinked. The system and method need no human interaction in order to calculate parameters and utilizing formulas used for the delinking decisions.

Abstract: Disclosed is a system for, and method of, determining whether records and entity representations should be delinked. The system and method need no human interaction in order to calculate parameters and utilizing formulas used for the delinking decisions.

Abstract: Disclosed is a system for, and method of, calculating parameters used to determine whether records and entity representations should be linked. The system and method use a symmetric and reflexive function to allow for linking records and entity representations whose field values differ. The system and method apply iterative techniques such that parameters from each linking iteration are used in the next linking iteration. The system and method need no human interaction in order to calibrate and utilize record matching formulas used for the linking decisions. These techniques may be used for geographic location proximity matching.

Abstract: Disclosed is a system for, and method of, determining whether records and entity representations should be delinked. The system and method need no human interaction in order to calculate internal match scores by considering data associated with an entity representation and external match scores by considering data external to the entity representation. The system and method uses the internal match scores and external match scores to make the delinking decisions.

Abstract: Disclosed is a system for, and method of, determining whether records and entity representations should be delinked. The system and method need no human interaction in order to calculate internal match scores by considering data associated with an entity representation and external match scores by considering data external to the entity representation. The system and method uses the internal match scores and external match scores to make the delinking decisions.

Abstract: Disclosed is a system for, and method of, determining whether records and entity representations should be delinked. The system and method need no human interaction in order to calculate parameters and utilizing formulas used for the delinking decisions.

Abstract: Disclosed herein are various exemplary systems and methods for conducting legal research using clustering analytics. A system for building relationships between passages, the system comprising a passage generation module configured to generate passages from one or more case law documents, an annotation module configured to annotate the passages based on one or more attributes, and a clustering module configured to build relationship clusters between the passages based on the one or more attributes.

Abstract: Disclosed is a system for, and method of, calculating parameters used to determine whether records and entity representations should be linked. The system and method use a symmetric and reflexive function to allow for linking records and entity representations whose field values differ. The system and method apply iterative techniques such that parameters from each linking iteration are used in the next linking iteration. The system and method need no human interaction in order to calibrate and utilize record matching formulas used for the linking decisions. These techniques may be used for geographic location proximity matching.

Abstract: A system and methods for parallel processing of queries to one or more databases are described herein. One or more databases may be distributed among a subset of slave nodes of a global-results processing matrix. A query to the database may be generated using a query-based high-level programming language. The query-based source code then may be converted to intermediary source code in a common programming language and then compiled into a dynamic link library (DLL) or other type of executable. The DLL is then distributed among the slave nodes of the processing matrix, whereupon the slave nodes execute related portions of the DLL substantially in parallel to generate initial query results. The initial query results may then be provided to a master node of the global-results processing matrix for additional processing, whereby the master node is adapted to execute one or more associated portions of the DLL on the initial query results.

Abstract: Various exemplary systems and methods for linking entity references and identifying associations are presented. In particular, a method is provided for linking a plurality of entity references to at least one entity. The method comprises the steps of evaluating a probability of a match between a first entity reference and a second entity reference based at least in part on a statistical significance of one or more field values being common to both the first entity reference and the second entity reference, wherein field value statistical significance is inversely related to a number of field value occurrences occurring in some or all of the plurality of entity references and linking the first entity reference with the second entity reference when the probability is greater than or equal to a match threshold.

Abstract: Various exemplary systems and methods for linking entity references and identifying associations are presented. In particular, a method for linking a plurality of entity references to at least one entity using one or more constructed ghost entity references is provided. The method comprises the steps of identifying, for one or more common data fields, at least one unique field value from one or more entity references linked to a given entity and constructing, for the given entity, at least one ghost entity reference including the at least one unique field value, wherein the at least one ghost entity reference represents at least one potential entity reference for the given entity. The method further comprises linking at least one of the plurality of entity references to the given entity when a match probability between the at least one entity reference and the ghost entity reference is greater than a defined threshold.

Abstract: A system and method for configuring a plurality of processing nodes into a parallel-processing database system are described herein. Each of a plurality of processing nodes connected by a network receive software and one or more configuration files related to the intended function of the processing node. The software may include homogeneous agent software, one or more library dynamic-link libraries (DLL), and the like. The configuration file is used to configure the homogeneous agent to operate as the intended node in a global-results processing matrix, a general-purpose query processing matrix, or a index-base query processing matrix. Another node or nodes may be configured to convert query-based programming code to intermediary source code in a common programming language and then compile the intermediary source code into a dynamic link library (DLL) or other type of executable.