Rapid fuzzy string matching in C++ using the Levenshtein Distance
-
Updated
Aug 27, 2025 - C++
Rapid fuzzy string matching in C++ using the Levenshtein Distance
Effcee is a C++ library for stateful pattern matching of strings, inspired by LLVM's FileCheck
A collection of useful data structures and algorithms for competitive programming.
The Levenshtein Python C extension module contains functions for fast computation of Levenshtein distance and string similarity
PFAC is an open library for exact string matching performed on NVIDIA GPUs
Team reference for Competitive Programming. Algorithms implementations very used in the ACM-ICPC contests. Latex template to build your own team reference.
Library and command line utility to do approximate string matching of a source against a bitext index and get matched source and target.
🔉 Python wrapper for a C++ Double Metaphone
Fast and simple algorithms for computing both LCSk and LCSk+
Implementation of various string matching algorithms and their experimental analysis. Contains paper describing different string matching algorithms with their time and space complexities.
Algorithms
数据结构和算法
This project contains implementation and explanations of some data structures and algorithms.
C++ library for Lua style pattern matching
Fast fuzzy string search
this is repo about my solutions of problems in Data Structures and Algorithms Specialization in coursera site from algorithmic toolbox to Genome Assembly Programming Challenge
Cython bindings on C++ aho_corasick libarary
C++ Parsing/searching/validating expression grammar library (PEG) To write Regex-like expressions in the core
A C++ Implementation of the Aho-Corasick pattern matching algorithm.
Add a description, image, and links to the string-matching topic page so that developers can more easily learn about it.
To associate your repository with the string-matching topic, visit your repo's landing page and select "manage topics."