Compute the edit distance between two strings - CSharp System

CSharp examples for System:String Algorithm

  1. HOME
  2. CSharp
  3. System
  4. String Algorithm

Description

Compute the edit distance between two strings

Demo Code


using System;/* www. jav a 2s.  c  om*/

public class Main{
        /// <summary>
        /// Compute the edit distance between two strings.
        /// From : https://www.dotnetperls.com/levenshtein
        /// </summary>
        public static int LevenshteinDistance(string s, string t)
        {
            int n = s.Length;
            int m = t.Length;
            int[,] d = new int[n + 1, m + 1];

            if (n == 0)
                return m;
            if (m == 0)
                return n;

            for (int i = 0; i <= n; d[i, 0] = i++) { }
            for (int j = 0; 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;
                    d[i, j] = Math.Min(Math.Min(d[i - 1, j] + 1, d[i, j - 1] + 1), d[i - 1, j - 1] + cost);
                }

            return d[n, m];
        }
}

Related Tutorials