Re: String Similarity

Started by Pang Zaihuover 19 years ago2 messages
#1Pang Zaihu
pangzh@cis.pku.edu.cn

Hello!
Would you like to give me a simple introduction of Levenshtein distence function?
Thank you!

On 2006-05-19 19:54, Martijn van Oosterhout wrote: > On Fri, May 19, 2006 at 04:00:48PM -0400, Mark Woodward wrote: > > (3) Is there also a desire for a Levenshtein distence function for text > > and varchars? I experimented with it, and was forced to write the function > > in item #1. > > Postgres already has a Levenshtein distence function, see fuzzystrmatch > in contrib. Whatever you come up with might fit in well there... > > Have a nice day, > > From each according to his ability. To each according to his ability to litigate. >

#2Noname
tomas@tuxteam.de
In reply to: Pang Zaihu (#1)

-----BEGIN PGP SIGNED MESSAGE-----
Hash: SHA1

On Tue, Sep 26, 2006 at 09:09:33AM +0800, Pang Zaihu wrote:

Hello!
Would you like to give me a simple introduction of Levenshtein distence function?

Better than I could explain:

<http://en.wikipedia.org/wiki/Levenshtein_distance&gt;

Thank you!

Thank Wikipedia ;-)

HTH
- -- tomas
-----BEGIN PGP SIGNATURE-----
Version: GnuPG v1.4.1 (GNU/Linux)

iD8DBQFFG1UIBcgs9XrR2kYRAr42AJ0TjRnUBqmogcKg12mXRVFl6oAjqQCeP/hw
HmqRS+AANLP9eNbNIWp7jOM=
=FHks
-----END PGP SIGNATURE-----