Try the Levenshtein Distance algorithm. If you scroll to the bottom of the
page you will see a PL/SQL implementation.
> -----Original Message-----
> From: [EMAIL PROTECTED] [mailto:[EMAIL PROTECTED]
>
> yes, Im familiar with that function. but you have to write a
> soundex algorithm in order to get advanced functionality. I
> wouldnt even know where to start with something like that.
>
> Im hoping there is one on the web some where.
--
Please see the official ORACLE-L FAQ: http://www.orafaq.net
--
Author: Jacques Kilchoer
INET: [EMAIL PROTECTED]
Fat City Network Services -- 858-538-5051 http://www.fatcity.com
San Diego, California -- Mailing list and web hosting services
---------------------------------------------------------------------
To REMOVE yourself from this mailing list, send an E-Mail message
to: [EMAIL PROTECTED] (note EXACT spelling of 'ListGuru') and in
the message BODY, include a line containing: UNSUB ORACLE-L
(or the name of mailing list you want to be removed from). You may
also send the HELP command for other information (like subscribing).
Received on Mon Jun 09 2003 - 13:57:02 CDT
