533 packages returned for Tags:"approximate-string-matching"

The fastest Levenshtein on NuGet. Supports .NET Framework and .NET Core (.NET Standard 1.0). Levenshtein calculates the shortest possible distance between two strings. Producing a count of the number of insertions, deletions and substitutions to make one string into another.
  • 45,314 total downloads
  • last updated 7/19/2019
  • Latest version: 2.1.1
  • string
A collection of utilities for working with strings in .NET.
BlueSimilarity is a string similarity metric library with semantic learning optimized for speed and simple usage (edit distance - Levenshtein, Damerau-Levenshtein; Levenshtein, Damerau-Levenshtein, Jaro, Jaro-Winkler, Jaccard, Dice, Overlap, Semantic Bag of Words Similarity, TFIDF, SoftTFIDF)
C# library for fast approximate nearest neighbours search using Hierarchical Navigable Small World graphs. Fork from original at https://github.com/microsoft/HNSW.Net, adds support for incremental build and MessagePack serialization.
  • 1,104 total downloads
  • last updated 9/1/2016
  • Latest version: 1.0.0
  • pattern matching
Simple type safe pattern matching for C#
  • 1,378 total downloads
  • last updated 7/6/2017
  • Latest version: 1.0.4
  • string
It transforms words into cubes. Yep, that's it.