Patent ID: 8117237
Filing Date: 2012-02-14
Classification: G06F

Abstract:
1. A method making it possible to manage named entities that are presented in different graphical or syntactic forms and refer to the same entity contained in a database ( 3 ), wherein it comprises at least the following steps: applying a Levenshtein method to said entities E with S l being the measurement of similarity between the two entities (E i ,E j ) in the database, D being the Levenshtein distance between the two entities, |E i | respectively |E j | being the number of characters of E i , respectively E j , using the n-grams method to create a similarity S by extracting from the two entities E i and E j the sets N i of the n-grams of E i and the set N j of the n-grams of E j , then defining the number of n-grams |N i | deduced from E i and the number of n-grams |N j | deduced from E j , the similarity between E 1 and E j is then defined by: using a method of merging the data on said entities in the database in order to construct at least 2 classifications, respectively relating to the n-grams similarity with n greater than or equal to 2, said classifications corresponding to sets of entity partitions P finding the consensus partition P