Showing 15 of 15 projects
A Java library implementing various string similarity and distance algorithms like Levenshtein, Jaro-Winkler, and n-gram methods.
A Python library for approximate and phonetic string matching, implementing algorithms like Levenshtein distance and Soundex.
A comprehensive Go library for string comparison and edit distance algorithms, including Levenshtein, LCS, Hamming, Jaro-Winkler, and Cosine similarity.
A lightweight Laravel package for user-driven database searching with fuzzy matching and multiple search drivers.
A high-performance Go library for calculating Levenshtein distance between strings, including Unicode support.
A fast C++ library for fuzzy string matching using Levenshtein Distance, offering MIT licensing and algorithmic improvements.
A Ruby gem for calculating edit distance between strings using Levenshtein, Damerau-Levenshtein, and Boehmer & Rees algorithms.
A .NET library implementing various string similarity and distance metrics like Levenshtein, Jaro-Winkler, and Soundex.
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.
A collection of fuzzy string matching algorithms and phonetic metrics for Elixir, including Levenshtein, Jaro-Winkler, Soundex, and more.
Fast Ruby FFI gem providing C implementations of string edit distance algorithms like Levenshtein, Jaro-Winkler, and N-Gram.
An Elixir library providing fast, comprehensive string similarity metrics for approximate matching.
A Common Lisp library for efficiently calculating various string similarity and distance metrics.
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.