public class Levenshtein : object, IMetric<string>, IDistance<string>, IDistance<string, string>, ICloneable
In information theory and computer science, the Levenshtein distance is a string metric for measuring the difference between two sequences. Informally, the Levenshtein distance between two words is the minimum number of single-character edits (i.e. insertions, deletions or substitutions) required to change one word into the other. It is named after Vladimir Levenshtein, who considered this distance in 1965.
Levenshtein distance may also be referred to as edit distance, although that may also denote a larger family of distance metrics. It is closely related to pairwise string alignments.
public object Clone()
|System.Object||A new object that is a copy of this instance.|
public double Distance(string x, string y)
|System.String||x||The first point
|System.String||y||The second point
A double-precision value representing the distance