Search Postgresql Archives

Re: Merge rows based on Levenshtein distance

[Date Prev][Date Next][Thread Prev][Thread Next][Date Index][Thread Index]

 



I don't think you've defined your problem very clearly. 

Suppose you have 1000 names in your database.  Are you planning to compare each name to the other 999 names to see which is closest?  What if two names are equally close to a third name but not to each other, how do you decide which is better? 
--
Mike Nolan


[Date Prev][Date Next][Thread Prev][Thread Next][Date Index][Thread Index]
[Index of Archives]     [Postgresql Jobs]     [Postgresql Admin]     [Postgresql Performance]     [Linux Clusters]     [PHP Home]     [PHP on Windows]     [Kernel Newbies]     [PHP Classes]     [PHP Books]     [PHP Databases]     [Postgresql & PHP]     [Yosemite]
  Powered by Linux