ML's radishal Universal Levenshtein Automata library.
-
Updated
Jan 5, 2022 - OCaml
ML's radishal Universal Levenshtein Automata library.
SimFind is a database approach to similarity search (approximate matching).
R+-Tree with augmentations to support Textual-Spatial-Queries
Simple spellchecker uses approximate string matching(fuzzy search) algorithm based on Levenshtein distance between two strings
in-memory key value server (based on radix-tree) with fuzzy search capabilities
Search Approximate String Matching using multithreading
This repo contains the Python 3 compatible code for SymSpell algorithm
Detect lexical blending using similarity by approximate string matching and word vectors
Approximate string matching library implemented in Go language
🔎 a command-line interface for pattern matching
Bioinformatics algorithms for DNA pattern searching
A @rust-lang library aiming to provide regexes with fuzzy matching
TRE JNI Wrapper(TREJ) provides a Java interface that allows you access the native functions that have been defined in TRE. TRE(https://github.com/laurikari/tre/) is a lightweight, robust, and efficient POSIX compliant regex matching package with support for approximate (fuzzy) matching.
Set of tools for implementing approximate search
This is the repository for the code of my Computer Science bachelor's degree final paper.
Nearest Neighbor Implementations for Java
miRNA-UTR approximate matching algorithms in R/Python/Bash
Fuzzy search for the Bible
Add a description, image, and links to the approximate-string-matching topic page so that developers can more easily learn about it.
To associate your repository with the approximate-string-matching topic, visit your repo's landing page and select "manage topics."