Implement Fuzzy Search in Syncfusion WinUI AutoComplete

public int LevenshteinDistance(string searchWord, string actualWord)
{
  var searchWordLength = searchWord.Length;
  var actualWordLength = actualWord.Length;

  //Forming a table that has a length one higher in both rows and columns.
  var matrix = new int[searchWordLength + 1, actualWordLength + 1];

  if (searchWordLength == 0)
     return actualWordLength;

  if (actualWordLength == 0)
     return searchWordLength;

  //Initializing with indices.
  for (var i = 0; i <= searchWordLength; matrix[i, 0] = i++) { }
  for (var j = 0; j <= actualWordLength; matrix[0, j] = j++) { }

  for (var i = 1; i <= searchWordLength; i++)
  {
    for (var j = 1; j <= actualWordLength; j++)
    {
       //If the characters do not match, we will add 1.
       var cost = (actualWord[j - 1] == searchWord[i - 1]) ? 0 : 1;

       //Minimum of the 3 cells + above cost.
       matrix[i, j] = Math.Min(
       Math.Min(matrix[i - 1, j] + 1, matrix[i, j - 1] + 1),
       matrix[i - 1, j - 1] + cost);
     }
  }
  // Return the value at the right bottom.
  return matrix[searchWordLength, actualWordLength];
}

<editors:SfAutoComplete
                Width="200"
                HorizontalAlignment="Center"
                VerticalAlignment="Center"
                PlaceholderText="Select the social media"
                ItemsSource="{Binding SocialMedias}">
 <editors:SfAutoComplete.FilterBehavior>
   <local:CustomFiltering/>
 </editors:SfAutoComplete.FilterBehavior>
</editors:SfAutoComplete>

namespace FuzzySearching
{
  public class CustomFiltering : IAutoCompleteFilterBehavior
  {
    public Task<object> GetMatchingItemsAsync(SfAutoComplete source, AutoCompleteFilterInfo filterInfo)
    {
      //To include the results that match the search word.
      List<string> builtInResult = (source.ItemsSource as 
List<string>).Where(stringToCheck => stringToCheck.ToLower().Contains(filterInfo.Text.ToLower())).ToList();

      //Results found through the new fuzzy search logic. To allow words with more differences, you can decrease the value.
      List<string> fuzzyResult = FuzzySearch(filterInfo.Text, source.ItemsSource as List<string>, 0.4);

      //Combining both the results and returning it.
      IEnumerable<string> combinedResult = builtInResult.Union(fuzzyResult);
      return Task.FromResult((object)combinedResult);
    }

    public List<string> FuzzySearch(string searchWord, List<string> actualWords, double requiredMatchingFactor)
    {
      List<string> foundWords = new List<string>();

      foreach (string s in actualWords)
      {
        // Calculate the Levenshtein-distance.
        int levenshteinDistance =
LevenshteinDistance(s, searchWord);

        // Length of the longer string.
        int length = Math.Max(searchWord.Length, s.Length);

        // Calculate the score and convert to the matching factor.
        double matchingFactor = 1.0 - (double)levenshteinDistance / length;

        //If the matching factor is higher than the required matching factor, we will include that word.
        //The lower the required matching factor, the more difference between the words will be allowed.
        if (matchingFactor > requiredMatchingFactor)
            foundWords.Add(s);
     }
     return foundWords;
   }

   public int LevenshteinDistance(string searchWord, string actualWord)
   {
      var searchWordLength = searchWord.Length;
      var actualWordLength = actualWord.Length;

      //Forming a table that has a length one higher in both rows and columns.
      var matrix = new int[searchWordLength + 1, actualWordLength + 1];

      if (searchWordLength == 0)
         return actualWordLength;

      if (actualWordLength == 0)
         return searchWordLength;

      //Initializing with indices.
      for (var i = 0; i <= searchWordLength; matrix[i, 0] = i++) { }
      for (var j = 0; j <= actualWordLength; matrix[0, j] = j++) { }

      for (var i = 1; i <= searchWordLength; i++)
      {
        for (var j = 1; j <= actualWordLength; j++)
        {
           //If the characters do not match, we will add 1.
           var cost = (actualWord[j - 1] == searchWord[i - 1]) ? 0 : 1;

          //Minimum of the 3 cells + above cost.
          matrix[i, j] = Math.Min(
            Math.Min(matrix[i - 1, j] + 1, matrix[i, j - 1] + 1),
            matrix[i - 1, j - 1] + cost);
        }
      }
      // Return the value at the bottom right. 
      return matrix[searchWordLength, actualWordLength];
    }
  }

  public sealed partial class MainWindow : Window
  {
    public MainWindow()
    {
       this.InitializeComponent();
    }
  }

  public class SocialMediaViewModel
  {
    public List<string> SocialMedias { get; set; }
    public SocialMediaViewModel()
    {
      this.SocialMedias = new List<string>();
      this.SocialMedias.Add("Facebook");
      this.SocialMedias.Add("Twitter");
      this.SocialMedias.Add("Google Plus");
      this.SocialMedias.Add("Instagram");
      this.SocialMedias.Add("LinkedIn");
      this.SocialMedias.Add("Skype");
      this.SocialMedias.Add("Telegram");
      this.SocialMedias.Add("Televzr");
      this.SocialMedias.Add("Tik Tok");
      this.SocialMedias.Add("Tout");
      this.SocialMedias.Add("Tumblr");
      this.SocialMedias.Add("Twitter");
      this.SocialMedias.Add("Vimeo");
      this.SocialMedias.Add("WhatsApp");
      this.SocialMedias.Add("YouTube");
    }
  }
}