>
>Those search techniques are built into the dictionary server software. The
>RFC for dictionary servers can be found here...
>
>http://www.faqs.org/rfcs/rfc2229.html
>
Thanks for the answer. I've been looking at those and they seem to be
something that needs some time to grasp (at least for someone like me :-) )
Although I have not come up with any CF implementation so far that would
use SOUNDEX or Levenshtein, I did find a UDF at
http://www.cflib.org/udf.cfm?ID=1067 that calculates the Levenshtein
distance for two strings. Does anyone think that this could be a possible
solution, adapted/modified to take terms from a database and perform a
comparison to index approximate hits?
Thanks for any opinions,
Roberto Perez
[EMAIL PROTECTED]
[Todays Threads] [This Message] [Subscription] [Fast Unsubscribe] [User Settings] [Donations and Support]
