Showing 9 of 9 projects
A Java library implementing various string similarity and distance algorithms like Levenshtein, Jaro-Winkler, and n-gram methods.
A fast C++ library for fuzzy string matching using Levenshtein Distance, offering MIT licensing and algorithmic improvements.
A Ruby gem providing a fast, accurate, and encoding-aware implementation of the Jaro-Winkler string similarity algorithm.
A .NET library implementing various string similarity and distance metrics like Levenshtein, Jaro-Winkler, and Soundex.
A Python library for computing string similarity metrics including Levenshtein, Hamming, Jaccard, and Sorensen distances.
Rust edit distance library accelerated with SIMD for fast Hamming, Levenshtein, and Damerau-Levenshtein calculations.
A Go package for calculating Levenshtein distance and similarity metrics with customizable edit costs and prefix bonuses.
An Elixir natural language processor for tokenization, counting, and string similarity analysis.
A Crystal library implementing edit distance algorithms including Levenshtein, Damerau-Levenshtein, Optimal Alignment, Jaro, and Jaro-Winkler.
Open-Awesome is built by the community, for the community. Submit a project, suggest an awesome list, or help improve the catalog on GitHub.