Libraries tagged by edit distance

Calculate the Levenshtein distance and edit progresses between two strings.

Go to Download

rhyme suggester based on phonetics, using edit-distance algorithm

Go to Download

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.

Go to Download

Weighted Levenshtein, Optimal String Alignment, and Damerau-Levenshtein distance for PHP 8.4+ — a port of infoscout/weighted-levenshtein.

Go to Download

Levenshtein Distance calculates the minimum number of single-character edits needed to transform one string into another.

Go to Download

Execute PSR-15 RequestHandlerInterface instances and emit responses they generate.

Go to Download

Execute PSR-15 RequestHandlerInterface instances and emit responses they generate.

Go to Download

PHP 7.0 support for: Execute PSR-15 RequestHandlerInterface instances and emit responses they generate.

Go to Download