using System;

using FuzzySharp;

using System.Collections;

​

public class Program

{

    public static void Main()

    {

        string WordToCheck = "ECM".ToLower();

        Console.WriteLine("Searching for ( " + WordToCheck + " )");

        Console.WriteLine(Fuzz.Ratio("DVS:ENGSTEREOBULSTEREO", "DVS:BULSTEREO"));

        Console.WriteLine("Answer should be option G as it has the actual word");

        var test = FuzzyMatch.FuzzyMatcher.FuzzyMatch("DVS:ENGSTEREOBULSTEREO", "DVS:BULSTEREO");

        Console.WriteLine(test);

        Console.WriteLine("----------------------------- FuzzySharp -----------------------------");

        Console.WriteLine("Choice A " + Fuzz.Ratio(WordToCheck, "Open Electronic Notebook".ToLower()));

        Console.WriteLine("Choice B " + Fuzz.Ratio(WordToCheck, "Open Voice Note".ToLower()));

        Console.WriteLine("Choice C " + Fuzz.Ratio(WordToCheck, "Transcribe".ToLower()));

        Console.WriteLine("Choice D " + Fuzz.Ratio(WordToCheck, "Open Company Experiement SOP".ToLower()));

        Console.WriteLine("Choice E " + Fuzz.Ratio(WordToCheck, "Open Company Lab Documents".ToLower()));

        Console.WriteLine("Choice F " + Fuzz.Ratio(WordToCheck, "Open Form For LIMS".ToLower()));

        Console.WriteLine("Choice G " + Fuzz.Ratio(WordToCheck, "Open Form For ECM".ToLower()));

        Console.WriteLine("----------------------------- LevenshteinDistance2 -----------------------------");

        Console.WriteLine("Choice A " + LevenshteinDistance2(WordToCheck, "Open Electronic Notebook".ToLower()));

        Console.WriteLine("Choice B " + LevenshteinDistance2(WordToCheck, "Open Voice Note".ToLower()));

        Console.WriteLine("Choice C " + LevenshteinDistance2(WordToCheck, "Transcribe".ToLower()));

        Console.WriteLine("Choice D " + LevenshteinDistance2(WordToCheck, "Open Company Experiement SOP".ToLower()));

        Console.WriteLine("Choice E " + LevenshteinDistance2(WordToCheck, "Open Company Lab Documents".ToLower()));

        Console.WriteLine("Choice F " + LevenshteinDistance2(WordToCheck, "Open Form For LIMS".ToLower()));

        Console.WriteLine("Choice G " + LevenshteinDistance2(WordToCheck, "Open Form For ECM".ToLower()));

        //Console.WriteLine("Choice A " + LevenshteinDistance(WordToCheck,"Open Electronic Notebook".ToLower()));

        //Console.WriteLine("Choice B " + LevenshteinDistance(WordToCheck,"Open Voice Note".ToLower()));

        //Console.WriteLine("Choice C " + LevenshteinDistance(WordToCheck,"Transcribe".ToLower()));

        //Console.WriteLine("Choice D " + LevenshteinDistance(WordToCheck,"Open Company Experiement SOP".ToLower()));

        //Console.WriteLine("Choice E " + LevenshteinDistance(WordToCheck,"Open Company Lab Documents".ToLower()));

        //Console.WriteLine("Choice F " + LevenshteinDistance(WordToCheck,"Open Form For LIMS".ToLower()));

        //Console.WriteLine("Choice G " + LevenshteinDistance(WordToCheck,"Open Form For ECM".ToLower()));

        //Console.WriteLine("Hello World " + LevenshteinDistance("World","Worid now"));

        //Console.WriteLine("Hello World " + LevenshteinDistance("World","Worid"));

        //Console.WriteLine("Hello World " + LevenshteinDistance("Hello","World"));

        //Console.WriteLine("Choice A " + LevenshteinDistance("THE BROWN FOX JUMPED OVER THE RED COW","THE RED COW JUMPED OVER THE GREEN CHICKEN"));

        //Console.WriteLine("Choice B " + LevenshteinDistance("THE BROWN FOX JUMPED OVER THE RED COW","THE RED COW JUMPED OVER THE RED COW"));

        //Console.WriteLine("Choice C " + LevenshteinDistance("THE BROWN FOX JUMPED OVER THE RED COW","THE RED FOX JUMPED OVER THE BROWN COW"));

    }

​

    public static int Compute(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];

    }

​

    public static int LevenshteinDistance2(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];

    }

​

    public static float LevenshteinDistance(string a, string b)

    {

        var rowLen = a.Length;

        var colLen = b.Length;

        var maxLen = Math.Max(rowLen, colLen);

        // Step 1

        if (rowLen == 0 || colLen == 0)

        {

            return maxLen;

        }

​

        /// Create the two vectors

        var v0 = new int[rowLen + 1];

        var v1 = new int[rowLen + 1];

        /// Step 2

        /// Initialize the first vector

        for (var i = 1; i <= rowLen; i++)

        {

            v0[i] = i;

        }

​

        // Step 3

        /// For each column

        for (var j = 1; j <= colLen; j++)

        {

            /// Set the 0'th element to the column number

            v1[0] = j;

            // Step 4

            /// For each row

            for (var i = 1; i <= rowLen; i++)

            {

                // Step 5

                var cost = (a[i - 1] == b[j - 1]) ? 0 : 1;

                // Step 6

                /// Find minimum

                v1[i] = Math.Min(v0[i] + 1, Math.Min(v1[i - 1] + 1, v0[i - 1] + cost));

            }

​

            /// Swap the vectors

            var vTmp = v0;

            v0 = v1;

            v1 = vTmp;

        }

​

        // Step 7

        /// The vectors were swapped one last time at the end of the last loop,

        /// that is why the result is now in v0 rather than in v1

        return v0[rowLen];

    }

}