SorensenDice, C# - rextester

Language: Layout:

//Rextester.Program.Main is the entry point for your code. Don't change it.
//Compiler version 4.0.30319.17929 for Microsoft (R) .NET Framework 4.5

using System;
using System.Collections.Generic;
using System.Linq;
using System.Text.RegularExpressions;

namespace Rextester
{
    public class Program
    {
        public static void Main(string[] args)
        {
            //http://stackoverflow.com/questions/36651729/dice-sorensen-distance-error-calculating-bigrams-without-using-intersect-method
            var bigramsAaaa = Bigrams("aaaa");            
            Console.WriteLine(bigramsAaaa.Count);
            foreach (var b in bigramsAaaa)
                Console.WriteLine(b);
            
            Console.WriteLine(DiceCoefficient( "this is not a correct string", "this is a correct string" ));
        }
        
        public static HashSet<string> Bigrams (string stOne)
        {
            HashSet<string> nx = new HashSet<string>();
            for(int i = 0; i < stOne.Length - 1; i++)
            {
                char x1 = stOne[i];
                char x2 = stOne[i + 1];
                string temp = x1.ToString() + x2.ToString();
                nx.Add(temp);
            }
            return nx;
        }
            
        public static double DiceCoefficient(string stOne, string stTwo)
        {
            HashSet<string> nx =Bigrams(stOne);
            HashSet<string> ny =Bigrams(stTwo);

HashSet<string> intersection = new HashSet<string>(nx);
            intersection.IntersectWith(ny);

double dbOne = intersection.Count;
            return (2 * dbOne) / (nx.Count + ny.Count);            
        }
    }
}

Show compiler warnings [ + ] Show input
Compilation time: 0,17 sec, absolute running time: 0,11 sec, cpu time: 0,11 sec, average memory usage: 14 Mb, average nr of threads: 3