A comprehensive, educational implementation of fuzzy search algorithms using Levenshtein distance. Learn how to implement fuzzy search in any language with pseudo code and examples.

A high-performance matcher designed to solve LOGICAL and TEXT VARIATIONS problems in word matching, implemented in Rust.

Fast discovery of similar strings in bulk

A little tool to filter the stranger strings from a binary so you can analyze the good ones - now in Rust!

Simple string matching with single- and multiple-wildcard operator

Rust book minigrep String searching CLI. Created Line struct for tracking additional information such as line number

Voca_rs is the ultimate Rust [unicode] string library, implemented as independent functions and on Foreign Types (String and str).

A library containing some simple string utilities that I used in my other projects.

Flashtext implementation in Rust

Pracownia z AiSD (2024), Instytut Informatyki, Uniwersytet Wrocławski

🔍 Levenshtein-Grouper: Uncover Textual Similarities Across Your File System in a Flash 🚀

Wildcard matching with an escaped character

Rust edit distance routines accelerated using SIMD. Supports fast Hamming, Levenshtein, restricted Damerau-Levenshtein, etc. distance calculations and string search.

Rust re-implementation of https://github.com/SanchithHegde/boyer-moore-visualization-python.

fast fuzzy string matching for Python

A trie-tree string-matching in rust.

List manipulation library with two-dimensional, dynamic-sized payload.

rmprefix can 1) remove a given prefix from the lines of input 2) replace a literal string with another.

A collection of algorithms in rust

Approximate Common Substring