Showing 8 of 8 projects
A Python library for computing distances between sequences with 30+ algorithms, pure Python implementation, and optional external libraries for speed.
A Java library implementing various string similarity and distance algorithms like Levenshtein, Jaro-Winkler, and n-gram methods.
An R package for joining data frames on inexact matching using string distance, regex, numeric tolerance, and other fuzzy criteria.
A high-performance Go library for calculating Levenshtein distance between strings, including Unicode support.
A comprehensive Natural Language Processing (NLP) library for the Crystal programming language.
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.
Fast Ruby FFI gem providing C implementations of string edit distance algorithms like Levenshtein, Jaro-Winkler, and N-Gram.
Open-Awesome is built by the community, for the community. Submit a project, suggest an awesome list, or help improve the catalog on GitHub.