This link has been bookmarked by 65 people . It was first bookmarked on 24 Jul 2006, by someone privately.
-
12 Mar 12
-
Levenshtein Distance, in Three Flavors
by Michael Gilleland
The purpose of this short essay is to describe the Levenshtein distance algorithm and show how it can be implemented in three different programming languages.
What is Levenshtein Distance?
Demonstration
The Algorithm
Source Code, in Three Flavors
References
Other Flavors
-
-
26 May 11
-
17 Nov 10
-
04 Nov 10
-
23 Oct 10
-
12 Jul 10
-
19 Apr 10
-
21 Oct 09
-
26 Jul 09
-
02 Apr 09
-
10 Nov 08
Robert FeltyA nice explanation of edit distance and a number of different implementations of edit distance
-
20 Sep 08
-
03 Sep 08
-
22 Feb 08
-
13 Feb 08
-
16 Dec 07
-
30 Nov 07
-
02 Jul 07
-
26 Mar 07
-
11 Jan 07
-
17 Oct 06
-
24 Aug 06
-
24 Jul 06
-
09 Jun 06
-
16 Mar 06
-
15 Oct 05
-
25 Jul 05
-
26 Apr 05
-
08 Feb 05
squalterLevenshtein distance is a measure of the similarity between two string
-
12 Nov 04
Would you like to comment?
Join Diigo for a free account, or sign in if you are already a member.