using System;

using System.Collections.Generic;

​

public class Program

{

        ///// NOTE: the term distance refers to the number of characters that would have to change

        //// for the first string compare and the second string compare to be equal

        public static List<StringsToCompare> populateTestData()

    {           

        // Change this or add new records to alter the strings being compared       

        var ListStrings = new List<StringsToCompare>();

        // Matches (distance = 0)

        ListStrings.Add(new StringsToCompare(1, "TysonBaker", "TysonBaker")); 

        // Matches only a few characters changed (distance 2)

        ListStrings.Add(new StringsToCompare(1, "TTysonTBaker", "TysonBaker")); 

        // Does not match none of the characters can line up (distance 10)

        ListStrings.Add(new StringsToCompare(1, "BakerTyson", "TysonBaker")); 

        // Does not match. the additional hypenated last name makes the distance 

        // too great to guarantee a match. (distance 10)

        ListStrings.Add(new StringsToCompare(1, "TysonBaker-OtherName", "TysonBaker")); 

        // Matches. The additional name suffix is short enough that it doesnt affect the compare (distance 3)

        ListStrings.Add(new StringsToCompare(1, "TysonBaker JR", "TysonBaker")); 

        return ListStrings;

    }

    public static void Main()

    {

        var test = populateTestData();

        var result = new List<int>();

        foreach (var item in test)

        {

            var distance = Levenshtein(item.String1, item.String2);

            Console.WriteLine($"FirstCompare: {item.String1} distance: {distance}");

            if(distance > 3) // change to 5

            {

                result.Add(distance);

            }

        }

        Console.WriteLine($"count greater than 3: {result.Count}");

    }

    public class StringsToCompare 

    {

        public StringsToCompare(int id, string string1, string string2)

        {

            Id = id;

            String1 = string1;

            String2 = string2;

        }

        public int Id {get; set; }

        public string String1 {get; set;}

        public string String2 {get; set;}

    }

​

    private static int Levenshtein(string s, string t)

        {

            int n = s.Length;

            int m = t.Length;

            int[,] d = new int[n + 1, m + 1];

​

            // Step 1

            if (n == 0)

            {

                return m;

            }

​

            if (m == 0)

            {

                return n;

            }

​

            // Step 2

            for (int i = 0; i <= n; d[i, 0] = i++)

            {

            }

​

            for (int j = 0; j <= m; d[0, j] = j++)

            {

            }

​

            // Step 3

            for (int i = 1; i <= n; i++)

            {

                //Step 4

                for (int j = 1; j <= m; j++)

                {

                    // Step 5

                    int cost = (t[j - 1] == s[i - 1]) ? 0 : 1;

​

                    // Step 6

                    d[i, j] = Math.Min(

                        Math.Min(d[i - 1, j] + 1, d[i, j - 1] + 1),

                        d[i - 1, j - 1] + cost);

                }

            }

            // Step 7

            return d[n, m];

        }

}