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 utilize blended field weights to account for certain types of partial matches. 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.

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 is a system for, and method of, identifying an entity representation. In some embodiments, search criteria are used to identify an entity representation in a universal database, and this identification is then used to identify a corresponding entity representation in a foreign database. Certain embodiments provide assurance, with a know probability of error, that the entity representation identified in the universal database is correct.

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.

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 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, supplementing an interne search. The disclosed techniques may be used to receive an initial internet search criteria entered by a user at an interface (such as a web site) to the internet search engine, identify an entity representation in a database that corresponds to the internet search criteria, and produce an enhanced internet search criteria that may incorporate both the initial internet search criteria and field values from the identified entity representation. The enhanced internet search criteria may be passed to the internet search engine in a manner that is transparent to a user.

Abstract: Disclosed is a system for, and method of, recycling field value weights as computed for database linking purposes. Such field value weights may be used for a search operation. In some embodiments, such weights may be used for a search operation prior to their values stabilizing during an iterative linking operation.

Abstract: Disclosed is a system for, and method of, searching for and identifying one or more entity representations using comprehensive search criteria built from known entity representations. The comprehensive search criteria are permitted to include inconsistent field values, that is, multiple different field values corresponding to the same field. The system and method may perform using search queries or batch files.

Abstract: Disclosed is a system for, and method of, searching for and identifying an entity representation. Some embodiments utilize a reflexive, symmetric and transitive function to allow for non-identical matches between field values. The function may be used to generate field value codes, which are associated with a portion of a field value weight for the original field value. In such embodiments, the field value weight for the original field values may be distributed among the original field value and the associated field value code.

Abstract: Disclosed is a system for, and method of, identifying an entity representation. In some embodiments, a match template is used to partition a search criteria so that an expected number of matching records does not exceed a desired threshold. In such embodiments, the match template may limit the number of records that are expected to identically match in certain fields designated as fixed fields, and limit the number of records that are expected to either identically match or have blank field values in certain fields designated as optional fields. Such embodiments thus provide probabilistic limits on a number of database fetches required for a particular search and on a number of record transfers required for a particular search.

Abstract: Disclosed is a system for, and method of, identifying an entity representation. In some embodiments, search criteria are used to identify an entity representation in a universal database, and this identification is then used to identify a corresponding entity representation in a foreign database. Certain embodiments provide assurance, with a know probability of error, that the entity representation identified in the universal database is correct.

Abstract: Techniques may be used to match records of a batch file to an entity representation in a universal database. Inputs may include, but are not limited to, a batch file and a universal (or other) database. The technique may compare the records of the batch file to the records of the universal database, and may attempt to create matches between the records in the batch file and the entity representations or records in the universal database. One possible output may include one or more tables that include foreign record IDs of the batch file records, each in association with an entity representation of the universal database. The techniques may include a batch style processing of records.

Abstract: Disclosed is a system for, and method of, searching for and identifying an entity representation. Some embodiments permit search criteria that are internally inconsistent. Such internally inconsistent criteria may include, for example, a maiden last name and a married last name. Certain embodiments account for such criteria in an intelligent manner and identify matching entity representations with a known confidence level of accuracy.

Abstract: Disclosed is a system for, and method of, identifying a universal entity representation in an electronic universal database that corresponds to a foreign entity representation in an electronic foreign database, each entity representation including a plurality of linked records, each record including a plurality of fields, each field capable of containing a field value, each field value associated with a field value weight.

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 utilize blended field weights to account for certain types of partial matches. 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.

Abstract: Field probabilities associated with fields in a database may be used to create one or more blocking criteria. The blocking criteria may be a set of fields that should be equal among two or more records in a database, so that a search of the records in the database according to the blocking criteria yields a subset of records approximately equal to or less than the specified maximum block size. Generic blocking criteria may also be created. The generic blocking criteria may be used for a batch comparison or batch linking operation within the records of the database.

Abstract: Disclosed is a system for, and method of, calculating parameters used to determine whether records and entity representations should be linked. Such parameters may be set as negative to account for fields that do not match. 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.

Abstract: Disclosed are systems for, and methods of, automatically detecting and treating field values of a particular field as null field values in records of a database. The system and method provide automatic treatment of these field values as null field values by calculating a critical frequency for the field. Based on the critical frequency of the field, the system and method treats field values that occur more than the critical frequency of the field as null field values and treats field values that occur less than the critical frequency as non-null field values.