SimFind is a database approach to similarity search (approximate matching).
-
Updated
May 30, 2020 - C++
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
🔎 a command-line interface for pattern 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.
Fast fuzzy string search
Cluster and merge similar string values: an R implementation of Open Refine clustering algorithms
Implementation of various string matching algorithms and their experimental analysis. Contains paper describing different string matching algorithms with their time and space complexities.
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."