Abstract: A system creates a query name bitmap signature comprising at least one bigram for a query name. The system calculates a query name bitmap range for the query name based on a match threshold and a number of bigrams in the query name bitmap signature. The system creates a data list name bitmap signature comprising at least one bigram, for each of a plurality of data list names, and identifies a subset of the plurality of data list names. The subset comprises data list name bitmap signatures that are within the query name bitmap range. The system reduces a number of comparisons by comparing only the query name and each of the subset of the plurality of data list names when performing the analytical name search. The system also reduces the number of comparisons by reducing the number of bit positions that are compared.

Abstract: A system creates a query name bitmap signature comprising at least one bigram for a query name. The system calculates a query name bitmap range for the query name based on a match threshold and a number of bigrams in the query name bitmap signature. The system creates a data list name bitmap signature comprising at least one bigram, for each of a plurality of data list names, and identifies a subset of the plurality of data list names. The subset comprises data list name bitmap signatures that are within the query name bitmap range. The system reduces a number of comparisons by comparing only the query name and each of the subset of the plurality of data list names when performing the analytical name search. The system also reduces the number of comparisons by reducing the number of bit positions that are compared.

Abstract: A similarity between character strings is assessed by identifying first and second character strings as candidate similar character strings, determining a frequency of occurrence for at least one of the first and second character strings from a collection of character strings, and designating the first and second character strings as similar based on the determined frequency of occurrence.

Abstract: A similarity between character strings is assessed by identifying first and second character strings as candidate similar character strings, determining a frequency of occurrence for at least one of the first and second character strings from a collection of character strings, and designating the first and second character strings as similar based on the determined frequency of occurrence.

Abstract: Methods for evaluating an original resolved entity in an entity resolution engine. A resolved entity is selected. The resolved entity includes two or more observed entities. It is attempted to separate the selected resolved entity into two or more virtual resolved entities based on a number of like features. In response to detecting that more than one virtual entity remains after decomposing the selected resolved entity, an entity resolution process is iteratively performed on each remaining virtual resolved entity until no further entity resolution events are triggered, and in response to detecting that two or more virtual resolved entities remain after the entity resolution process, the resolved entity is unresolved.

Abstract: Methods and apparatus, including computer program products, implementing and using techniques for evaluating an original resolved entity in an entity resolution engine. A resolved entity is selected. The resolved entity includes two or more observed entities. It is attempted to separate the selected resolved entity into two or more virtual resolved entities based on a number of like features. In response to detecting that more than one virtual entity remains after decomposing the selected resolved entity, an entity resolution process is iteratively performed on each remaining virtual resolved entity until no further entity resolution events are triggered, and in response to detecting that two or more virtual resolved entities remain after the entity resolution process, the resolved entity is unresolved.

Abstract: A similarity between character strings is assessed by identifying first and second character strings as candidate similar character strings, determining a frequency of occurrence for at least one of the first and second character strings from a collection of character strings, and designating the first and second character strings as similar based on the determined frequency of occurrence.

Abstract: A similarity between character strings is assessed by identifying first and second character strings as candidate similar character strings, determining a frequency of occurrence for at least one of the first and second character strings from a collection of character strings, and designating the first and second character strings as similar based on the determined frequency of occurrence.

Abstract: Provided are techniques to search for an entity in an entity resolution system. Search input comprising one or more attribute values of one or more attribute types is received. A resolution search is performed to generate a search result set comprising one or more entities and zero or more generic attribute values for generating additional entities. In response to determining that the resolution search generated at least two generic attribute values, one or more query searches are performed for a unique generic group by generic attribute type to identify the additional entities, wherein the unique generic group comprises a subset of the search input and includes at least two generic attribute types; the identified additional entities are combined with the entities in the search result set; and the search result set is returned.

Abstract: Systems, methods, and computer program products are disclosed for matching an inbound identity record to existing entities. A composite generic key may be generated from multiple entity resolution (ER) candidate-building keys determined to be generic keys. A query may be generated based on the composite generic key and executed to retrieve candidate entities for an inbound identity record.

Abstract: Systems, methods, and computer program products are disclosed for matching an inbound identity record to existing entities. A composite generic key may be generated from multiple entity resolution (ER) candidate-building keys determined to be generic keys. A query may be generated based on the composite generic key and executed to retrieve candidate entities for an inbound identity record.

Abstract: Non-distinct names are identified in a set of names. The set of names is obtained for a first entity. In response to comparing a first name and a second name in the set of names, it is determined that the first name is similar to the second name. Initials in the first name and the second name are searched for. In response to the search indicating that there is at least one initial in at least one of the first name and the second name, it is determined that the at least one initial matches a corresponding initial in another one of the first name and the second name and one of the first name and the second name are marked as a non-distinct name. A cross-entity scoring technique using distinct names in the set of names for the first entity and names in another set of names for a second entity is applied.

Abstract: Provided are techniques to search for an entity in an entity resolution system. Search input comprising one or more attribute values of one or more attribute types is received. A resolution search is performed to generate a search result set comprising one or more entities and zero or more generic attribute values for generating additional entities. In response to determining that the resolution search generated at least two generic attribute values, one or more query searches are performed for a unique generic group by generic attribute type to identify the additional entities, wherein the unique generic group comprises a subset of the search input and includes at least two generic attribute types; the identified additional entities are combined with the entities in the search result set; and the search result set is returned.

Abstract: Non-distinct names are identified in a set of names. The set of names is obtained for a first entity. In response to comparing a first name and a second name in the set of names, it is determined that the first name is similar to the second name. Initials in the first name and the second name are searched for. In response to the search indicating that there is at least one initial in at least one of the first name and the second name, it is determined that the at least one initial matches a corresponding initial in another one of the first name and the second name and one of the first name and the second name are marked as a non-distinct name. A cross-entity scoring technique using distinct names in the set of names for the first entity and names in another set of names for a second entity is applied.

Abstract: Systems, methods, and computer program products are disclosed for matching an inbound identity record to existing entities. A composite generic key may be generated from multiple entity resolution (ER) candidate-building keys determined to be generic keys. A query may be generated based on the composite generic key and executed to retrieve candidate entities for an inbound identity record.

Abstract: Systems, methods, and computer program products are disclosed for matching an inbound identity record to existing entities. A composite generic key may be generated from multiple entity resolution (ER) candidate-building keys determined to be generic keys. A query may be generated based on the composite generic key and executed to retrieve candidate entities for an inbound identity record.