amatch
A Ruby extension library implementing multiple algorithms for approximate string matching, searching, and comparison.
What is amatch?
amatch is a Ruby extension library that implements multiple algorithms for approximate string matching, searching, and comparison. It provides methods to compute various distance metrics like Levenshtein, Hamming, Jaro-Winkler, and longest common subsequence, enabling developers to perform fuzzy string operations in their Ruby applications.
Ruby developers who need to implement fuzzy string matching, search functionality with typos, data deduplication, or similarity comparisons in their applications.
It offers a comprehensive collection of string distance algorithms in a single, well-integrated Ruby library with a clean API, saving developers from implementing these complex algorithms themselves or using multiple disparate libraries.
Overview
Approximate String Matching library
Use Cases
Best For
- Implementing fuzzy search functionality in Ruby applications
- Building spell-checking or autocorrect features
Related Projects
Found a gem we're missing?
Open-Awesome is built by the community, for the community. Submit a project, suggest an awesome list, or help improve the catalog on GitHub.
