C#

2D Array

Static

using System;
using System.Collections.Generic;
class Program
{
static int Compute(string s, string t)
{
int n = s.Length;
int m = t.Length;
int[,] d = new int[n + 1, m + 1];
*// Verify arguments.*
if (n == 0)
{
return m;
}
if (m == 0)
{
return n;
}
*// Initialize arrays.*
for (int i = 0; i <= n; d[i, 0] = i++)
{
}
for (int j = 0; j <= m; d[0, j] = j++)
{
}
*// Begin looping.*
for (int i = 1; i <= n; i++)
{
for (int j = 1; j <= m; j++)
{
*// Compute cost.*
int cost = (t[j - 1] == s[i - 1]) ? 0 : 1;
d[i, j] = Math.Min(
Math.Min(d[i - 1, j] + 1, d[i, j - 1] + 1),
d[i - 1, j - 1] + cost);
}
}
*// Return cost.*
return d[n, m];
}
public static void Main()
{
List<string[]> l = new List<string[]>
{
new string[]{*"ant"*, *"aunt"*},
new string[]{*"Sam"*, *"Samantha"*}
};
**foreach** (string[] a in l)
{
int cost = Compute(a[0], a[1]);
Console.WriteLine(*"{0} -> {1} = {2}"*, a[0], a[1], cost);
}
}
}ant -> aunt = 1
Sam -> Samantha = 5

Levenshtein distance computations:

Dot Net Perls is a collection of tested code examples. Pages are continually updated to stay current, with code correctness a top priority.

Sam Allen is passionate about computer languages. In the past, his work has been recommended by Apple and Microsoft and he has studied computers at a selective university in the United States.

No updates found for this page.