Postgres Pro
Downloads
Home   >   mailing lists

Re: Merge rows based on Levenshtein distance - Mailing list pgsql-general

From Michael Nolan
Subject Re: Merge rows based on Levenshtein distance
Date
Msg-id CAOzAquJkBJxuYQE4xOGeUCcxpkUuKPM1uhYgcOL7n-5N+usbfw@mail.gmail.com
Whole thread Raw
In response to Re: Merge rows based on Levenshtein distance  (mongoose <akarargyris@gmail.com>)
Responses Re: Merge rows based on Levenshtein distance
List pgsql-general
Tree view
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 by date:

Previous
From: David G Johnston
Date:
Subject: Re: Merge rows based on Levenshtein distance
Next
From: mongoose
Date:
Subject: Re: Merge rows based on Levenshtein distance