Re: Merge rows based on Levenshtein distance

Поиск
Список
Период
Сортировка
От Michael Nolan
Тема Re: Merge rows based on Levenshtein distance
Дата
Msg-id CAOzAquJkBJxuYQE4xOGeUCcxpkUuKPM1uhYgcOL7n-5N+usbfw@mail.gmail.com
обсуждение исходный текст
Ответ на Re: Merge rows based on Levenshtein distance  (mongoose <akarargyris@gmail.com>)
Ответы Re: Merge rows based on Levenshtein distance  (mongoose <akarargyris@gmail.com>)
Список pgsql-general
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

В списке pgsql-general по дате отправления:

Предыдущее
От: David G Johnston
Дата:
Сообщение: Re: Merge rows based on Levenshtein distance
Следующее
От: mongoose
Дата:
Сообщение: Re: Merge rows based on Levenshtein distance