Re: Merge rows based on Levenshtein distance

From: Michael Nolan <htfoot(at)gmail(dot)com>
To: mongoose <akarargyris(at)gmail(dot)com>
Cc: "pgsql-general(at)postgresql(dot)org" <pgsql-general(at)postgresql(dot)org>
Subject: Re: Merge rows based on Levenshtein distance
Date: 2014-12-03 18:51:46
Message-ID: CAOzAquJkBJxuYQE4xOGeUCcxpkUuKPM1uhYgcOL7n-5N+usbfw@mail.gmail.com
Views: Raw Message | Whole Thread | Download mbox | Resend email
Thread:
Lists: 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

In response to

Responses

Browse pgsql-general by date

  From Date Subject
Next Message mongoose 2014-12-03 18:55:49 Re: Merge rows based on Levenshtein distance
Previous Message David G Johnston 2014-12-03 18:44:43 Re: Merge rows based on Levenshtein distance