Libraries tagged by levenshtein distance

oefenweb/damerau-levenshtein

39 Favers
231168 Downloads

Get text similarity level with Damerau-Levenshtein distance

tom-lingham/searchy

546 Favers
369257 Downloads

Laravel Searchy makes user driven searching easy with fuzzy search, basic string matching, Levenshtein Distance and more.

webd/language

28 Favers
156954 Downloads

A library for language processing. Includes string distance function (Levenshtein, Jaro-Winkler,...), stemming, etc.

highsolutions/laravel-searchy

6 Favers
33545 Downloads

Laravel Searchy makes user driven searching easy with fuzzy search, basic string matching, Levenshtein Distance and more.

php-extended/polyfill-str-levenshtein

0 Favers
160540 Downloads

A php implementation of the levenshtein distance without length limitation

edgaras/strsim

4 Favers
343 Downloads

Collection of string similarity and distance algorithms in PHP including Levenshtein, Damerau-Levenshtein, Jaro-Winkler, and more

henrik9999/string-similarity

1 Favers
9601 Downloads

Finds degree of similarity between two strings, based on Dice's Coefficient, which is mostly better than Levenshtein distance.

datingvip/damerau-levenshtein

0 Favers
1800 Downloads

Get text similarity level with Damerau-Levenshtein distance

jfcherng/php-levenshtein-distance

2 Favers
3846 Downloads

Calculate the Levenshtein distance and edit progresses between two strings.

gpupo/similarity

9 Favers
7022 Downloads

Calculate the similarity between strings and numbers working in a different way from a diff tool

internetguru/laravel-smart-redirect

0 Favers
596 Downloads

A configurable Laravel 11 middleware package that handles URL redirection based on defined routes and uses Levenshtein distance to find the closest matching route for 404 errors.

designbycode/levenshtein-distance

1 Favers
110 Downloads

The LevenshteinDistance class provides a method to calculate the Levenshtein distance between two strings. The Levenshtein distance is a measure of the minimum number of single-character edits (insertions, deletions, or substitutions) required to change one word into the other.

v-bartusevicius/levenshtein-array-sort

0 Favers
17 Downloads

Sorts haystack with strings by Levenshtein distance to needle

nullform/fuzzio

3 Favers
13 Downloads

Fuzzy search using similar_text() and levenshtein() functions. Easy to use and safe for multibyte encodings (UTF-8).

designbycode/fuzzy-search

0 Favers
9 Downloads

The Fuzzy Search package provides a simple and efficient way to perform fuzzy searches on a collection of texts using the Levenshtein distance algorithm. This package is useful when you need to search for texts that may contain typos or slight variations.

Next >>