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.

posthttps://api.moxon.dev/v6/levenshtein

Changed in 6.0.0

This endpoint moved from GET to POST. The two strings are now sent as a JSON body instead of query parameters, so they no longer appear in the URL — and therefore no longer in browser history or in the logs of any intermediary.

How it works?

The Levenshtein distance counts the minimum number of single-character edits (insertions, deletions, or substitutions) required to change one string into another. Useful for spell checking, fuzzy matching, DNA analysis, and plagiarism detection.

Try itpost/v6/levenshtein

curl -X POST \  "https://api.moxon.dev/v6/levenshtein" \  -H "Content-Type: application/json" \  -d '{}'

Send the request to see the response here.

Parameters

str1stringrequired
The first string (max 1000 characters)
str2stringrequired
The second string (max 1000 characters)

Both parameters are sent as a JSON body with Content-Type: application/json.

Response Fields

str1string
The first input string
str2string
The second input string
distancenumber
The Levenshtein distance between the two strings

Code Examples

curl -X POST \  "https://api.moxon.dev/v6/levenshtein" \  -H "Content-Type: application/json" \  -d '{    "str1": "example",    "str2": "samples"  }'

Error Handling

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

400Please provide a first string (str1)The str1 parameter is missing
400Please provide a second string (str2)The str2 parameter is missing

Edit this page on GitHub Report an issue

Last updated on September 13, 2026