PHPackages                             designbycode/levenshtein-distance - PHPackages - PHPackages  [Skip to content](#main-content)[PHPackages](/)[Directory](/)[Categories](/categories)[Trending](/trending)[Leaderboard](/leaderboard)[Changelog](/changelog)[Analyze](/analyze)[Collections](/collections)[Log in](/login)[Sign up](/register)

1. [Directory](/)
2. /
3. [Utility & Helpers](/categories/utility)
4. /
5. designbycode/levenshtein-distance

ActiveLibrary[Utility & Helpers](/categories/utility)

designbycode/levenshtein-distance
=================================

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.

v1.0.1(1y ago)1110[2 PRs](https://github.com/designbycode/levenshtein-distance/pulls)1MITPHP ^8.1|^8.2|^8.3

Since Jul 20Compare

[ Source](https://github.com/designbycode/levenshtein-distance)[ Packagist](https://packagist.org/packages/designbycode/levenshtein-distance)[ Docs](https://github.com/designbycode/levenshtein-distance)[ GitHub Sponsors](https://github.com/designbycode)[ RSS](/packages/designbycode-levenshtein-distance/feed)WikiDiscussions Synced 1mo ago

READMEChangelogDependencies (3)Versions (5)Used By (1)

### README not available

The README for this package hasn't been synced yet. View it on [GitHub](https://github.com/designbycode/levenshtein-distance).

###  Health Score

30

—

LowBetter than 64% of packages

Maintenance34

Infrequent updates — may be unmaintained

Popularity11

Limited adoption so far

Community5

Small or concentrated contributor base

Maturity58

Maturing project, gaining track record

How is this calculated?**Maintenance (25%)** — Last commit recency, latest release date, and issue-to-star ratio. Uses a 2-year decay window.

**Popularity (30%)** — Total and monthly downloads, GitHub stars, and forks. Logarithmic scaling prevents top-heavy scores.

**Community (15%)** — Contributors, dependents, forks, watchers, and maintainers. Measures real ecosystem engagement.

**Maturity (30%)** — Project age, version count, PHP version support, and release stability.

###  Release Activity

Cadence

Every ~0 days

Total

2

Last Release

657d ago

PHP version history (2 changes)v1.0.0PHP ^8.1

v1.0.1PHP ^8.1|^8.2|^8.3

### Community

Maintainers

![](https://www.gravatar.com/avatar/65820d809cbae9f6fa2f5984f3c584e97b8fad0824590cf23e36cc8d85166cb2?d=identicon)[claudemyburgh](/maintainers/claudemyburgh)

---

Tags

levenshteinlevenshtein-distancedesignbycode

###  Code Quality

TestsPest

Code StyleLaravel Pint

### Embed Badge

![Health badge](/badges/designbycode-levenshtein-distance/health.svg)

```
[![Health](https://phpackages.com/badges/designbycode-levenshtein-distance/health.svg)](https://phpackages.com/packages/designbycode-levenshtein-distance)
```

###  Alternatives

[atomescrochus/laravel-string-similarities

Compare two string and get a similarity percentage

70160.1k2](/packages/atomescrochus-laravel-string-similarities)[oefenweb/damerau-levenshtein

Get text similarity level with Damerau-Levenshtein distance

40265.8k4](/packages/oefenweb-damerau-levenshtein)[edgaras/strsim

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

2423.0k](/packages/edgaras-strsim)

PHPackages © 2026

[Directory](/)[Categories](/categories)[Trending](/trending)[Changelog](/changelog)[Analyze](/analyze)