Fuzzy search using Levenshtein Distance (LD) and Longest Common Substring (LCS) algorithm.
-
Updated
Jul 19, 2020 - PHP
Fuzzy search using Levenshtein Distance (LD) and Longest Common Substring (LCS) algorithm.
The PHP package for calculate similarity and Levenshtein distance between strings
MetaModels attribute for maintaining an search index with levenshtein support
✅ UTF-8 supported Levenshtein PHP function. A Function that finds similarity distance between two strings.
Add a description, image, and links to the levenshtein topic page so that developers can more easily learn about it.
To associate your repository with the levenshtein topic, visit your repo's landing page and select "manage topics."