Skip to content
moxon home

Levenshtein Distance

The /levenshtein endpoint allows you to calculate the Levenshtein distance between two strings. This distance represents the minimum number of operations required to transform one string into another.

gethttps://api.moxon.dev/v3/levenshtein

Parameters

  • str1stringrequired

    The first string

  • str2stringrequired

    The second string

Request Example

Request
GET /v3/levenshtein?str1=example&str2=samples

Response

Response
{
    "str1": "example",
    "str2": "samples",
    "distance": 3
}

Response Fields

FieldDescription
str1The first input string
str2The second input string
distanceThe Levenshtein distance between the two strings

cURL

cURL
curl -X GET "https://api.moxon.dev/v3/levenshtein?str1=example&str2=samples"

Error Handling

If parameters are missing or invalid, the API will return an error:

  • 400Please provide a first string (?str1={string})The str1 parameter is missing
  • 400Please provide a second string (&str2={string})The str2 parameter is missing

About Levenshtein Distance

The Levenshtein distance is a measure of the similarity between two strings. It counts the minimum number of single-character edits (insertions, deletions, or substitutions) required to change one string into the other. This is useful for:

  • Spell checking
  • DNA sequence analysis
  • Fuzzy string matching
  • Plagiarism detection
Edit this page on GitHubReport an issue

Last updated on April 8, 2026