String Matching
Showing 30 of 30 projects
Fuzzy string matching library for Python that calculates similarity between strings using Levenshtein Distance.
A high-performance string library leveraging SIMD and SWAR to accelerate search, hashing, sorting, and edit distances across C, C++, Python, Rust, and more.
Generates optimized regular expressions from a set of strings using automata theory and algorithmic minimization.
A tiny and blazing-fast fuzzy search implementation in JavaScript for flexible string matching.
A Python library for approximate and phonetic string matching, implementing algorithms like Levenshtein distance and Soundex.
A lightweight fuzzy-search library for Swift with zero dependencies.
A lightweight JavaScript library for fuzzy string searching and filtering, inspired by Sublime Text's command-p.
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 JavaScript library for matching and generating strings using patterns easier than regex, ideal for URL routing and data extraction.
A Ruby extension library implementing multiple algorithms for approximate string matching, searching, and comparison.
A fast C++ library for fuzzy string matching using Levenshtein Distance, offering MIT licensing and algorithmic improvements.
A fast fuzzy string matching library for Ruby that implements the Jaro-Winkler distance algorithm.
A Rust library providing fast linear time and space suffix arrays with full Unicode support.
A lightweight, zero-dependency JavaScript library for fuzzy searching arrays of objects.
A simple and lightweight fuzzy search engine that works in memory, searching for similar strings.
A JavaScript implementation of fzy's fuzzy string matching algorithm for scoring and highlighting matches.
Rust edit distance library accelerated with SIMD for fast Hamming, Levenshtein, and Damerau-Levenshtein calculations.
A fast, allocation-free Go library for simple wildcard pattern matching as an alternative to regex and filepath.Match.
A Rust library for simple string matching with single- and multiple-wildcard operators.
A Go package for calculating Levenshtein distance and similarity metrics with customizable edit costs and prefix bonuses.
An Elixir library providing fast, comprehensive string similarity metrics for approximate matching.
A Go library for matching and colorizing strings in terminal outputs with built-in and custom matchers.
A Crystal port of the Fzy fuzzy finder algorithm for fast and accurate string matching.
OCaml bindings to the PCRE library, providing Perl-compatible regular expressions for string matching.
A high-performance Aho-Corasick multi-pattern string matching library for Go, achieving up to 7 GB/s throughput with zero allocations.
A Node-RED node for chainable string manipulation using the string.js library with a visual editor.
A Ruby toolset for accurate fuzzy document searching using tuned TF-IDF with hybrid tokenization.
A Free Pascal port of FuzzyWuzzy for fuzzy string matching using Levenshtein distance algorithms.
A compile-time trie data structure implementation for the Crystal programming language.
Related Tags
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.