Re: similarity of names
From: Norbert Winkler <norbert.winkler1_at_gmx.de>
Date: Wed, 11 Mar 2009 14:59:25 +0100
Message-ID: <a6cb0mfk4w30.3bphbs6yc8zv$.dlg_at_40tude.net>
Am Mon, 9 Mar 2009 07:52:48 -0700 (PDT) schrieb fransh_at_hotmail.com:
Date: Wed, 11 Mar 2009 14:59:25 +0100
Message-ID: <a6cb0mfk4w30.3bphbs6yc8zv$.dlg_at_40tude.net>
Am Mon, 9 Mar 2009 07:52:48 -0700 (PDT) schrieb fransh_at_hotmail.com:
> UTL_MATCH
Thanks for advising to this, the "Levenshtein Distance" is IMHO the best
solution for similarity, I did'nt know that it exists in Oracle.
And in
http://www.oracle.com/technology/books/pdfs/expert%20oracle%20pl_sql%20ch%201.pdf
I see it's the well known algorithm they iterate in PL/SQL.
So I could give it a try to compare the speed of replace(replace(..
by a PL/SQL-cylce.
btw.
TRANSLATE() isn't a solution because I want to change German Umlaut � -->
AE (1 char into 2 chars)
-- Norbert Oracle9i Enterprise Edition Release 9.2.0.8.0 64BitReceived on Wed Mar 11 2009 - 08:59:25 CDT