Hai all,
Recently I faced a situation to compare the tolerance of to strings with the mistakes count, So that we can give tolerance to the comparison
static class LevenshteinDistance
{
public static int Compute(string s, string t)
{
if (string.IsNullOrEmpty(s))
{
if (string.IsNullOrEmpty(t))
return 0;
return t.Length;
}
if (string.IsNullOrEmpty(t))
{
return s.Length;
}
int n = s.Length;
int m = t.Length;
int[,] d = new int[n + 1, m + 1];
// initialize the top and right of the table to 0, 1, 2, ...
for (int i = 0; i <= n; d[i, 0] = i++);
for (int j = 1; j <= m; d[0, j] = j++);
for (int i = 1; i <= n; i++)
{
for (int j = 1; j <= m; j++)
{
int cost = (t[j - 1] == s[i - 1]) ? 0 : 1;
int min1 = d[i - 1, j] + 1;
int min2 = d[i, j - 1] + 1;
int min3 = d[i - 1, j - 1] + cost;
d[i, j] = Math.Min(Math.Min(min1, min2), min3);
}
}
return d[n, m];
}
}
“Levenshtein algorithm” is used for the purpose.
Here we can use the Compute Function with the two strings to calculate the difference between the strings
int ErrorCount = compute(“test”, “test”);
This Will return “0” as there is no difference between the both, as the number is less, the error will be less and the strings will be more similar.
Thank you
0 comments:
Post a Comment