Showing 11 of 11 projects
A high-performance string library leveraging SIMD and SWAR to accelerate search, hashing, sorting, and edit distances across C, C++, Python, Rust, and more.
A Swift library that computes minimal edits between two collections, primarily for animating UITableView and UICollectionView updates.
A comprehensive Go library for string comparison and edit distance algorithms, including Levenshtein, LCS, Hamming, Jaro-Winkler, and Cosine similarity.
A lightweight, super fast C/C++ and Python library for sequence alignment using edit (Levenshtein) distance.
A Swift micro-framework for efficient array diffs, collection observation, and UITableView/UICollectionView data source adapters.
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.
An incremental update tool for UITableView and UICollectionView that automates diff calculation and UI updates.
A Ruby library implementing Levenshtein and other edit distance algorithms for string comparison.
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.