A .NET library implementing various string similarity and distance metrics like Levenshtein, Jaro-Winkler, and Soundex.
SimMetrics.Net is a .NET library that provides implementations of various string similarity and distance metrics. It solves the problem of comparing strings with fuzzy matching by offering algorithms like Levenshtein edit distance, Jaro-Winkler similarity, and phonetic methods such as Soundex.
.NET developers who need to implement fuzzy string matching, duplicate detection, or phonetic comparison in applications like search engines, data cleaning, or record linkage systems.
Developers choose SimMetrics.Net because it consolidates numerous well-tested string similarity algorithms into a single library with broad .NET compatibility, eliminating the need to implement these complex metrics from scratch.
SimMetrics is a Similarity Metric Library, e.g. from edit distance's (Levenshtein, Gotoh, Jaro etc) to other metrics, (e.g Soundex, Chapman). This library support multiple .NET versions including .NET Core (NETStandard 1.x)
Includes over 15 similarity metrics from edit distances like Levenshtein to phonetic matching such as Soundex, providing a one-stop solution for diverse string comparison tasks.
Supports .NET Framework 2.0 through 4.5+ and .NET Standard up to 2.0, ensuring wide applicability across legacy and modern .NET environments without version conflicts.
Comes with 87 unit tests from the original SimMetrics project, ensuring high code quality and reliability for production use in scenarios like duplicate detection.
Implements algorithms like Soundex and Chapman metrics, enabling effective comparison of strings based on pronunciation, which is useful for name or address matching.
Based on the older SimMetricsCore project, which might include outdated coding practices or lack optimizations for modern .NET features like async/await or span-based operations.
The README primarily lists algorithms and frameworks without detailed examples, API references, or best practices, making it harder for developers to get started quickly.
Algorithms such as Levenshtein and Smith-Waterman can be computationally intensive for long strings or large datasets, with no built-in performance optimizations like caching or parallel processing mentioned.
This strongly-typed, client library enables working with Elasticsearch. It is the official client maintained and supported by Elastic.
Library of IQueryable extension methods to perform searching
Persistent, simple, powerful and portable autocomplete library
Elasticsearch .NET netstandard API
Open-Awesome is built by the community, for the community. Submit a project, suggest an awesome list, or help improve the catalog on GitHub.