Search for a tool
Levenshtein Distance

Tool to calculate Levenshtein's distance between words. Levenshtein measures a value between 2 words in order to find words closest to another in the dictionary or in a list.

Results

Levenshtein Distance -

Tag(s) : Data Processing

Share
Share
dCode and more

dCode is free and its tools are a valuable help in games, maths, geocaching, puzzles and problems to solve every day!
A suggestion ? a feedback ? a bug ? an idea ? Write to dCode!


Please, check our dCode Discord community for help requests!
NB: for encrypted messages, test our automatic cipher identifier!


Thanks to your feedback and relevant comments, dCode has developed the best 'Levenshtein Distance' tool, so feel free to write! Thank you!

Levenshtein Distance

Distance Measurement






Loading...
(if this message do not disappear, try to refresh this page)

Answers to Questions (FAQ)

How to measure the distance between 2 words?

Two words are close, if few things separate them orthographically or phonetically. The distance between two words is greater as the number of differences between the two words is large.

Example: CLOSE and CLOTHES are similar phonetically (homophone)

Example: TAKE and MAKE are similar graphycally (a kind of near-homograph)

The distance from Levenshtein is symmetrical, the distance from STRING1 to STRING2 is equal to the distance from STRING2 to STRING1

How does Levenshtein distance work?

The Levenshtein distance measures the similarity between two strings of characters. It is equal to the minimum number of characters to be deleted, inserted, or replaced to move from one string to another.

Example: DCODE is at a distance of 2 from DECODER (1- add E and 2- add R)

Example: DECODER is at a distance of 2 from DCODE (1- remove E and 2- remove R)

What is Levenshtein distance used for?

Calculating the distance between 2 strings of characters can make it possible to know their quantity of differences and thus also their amount of similarity. So the Levenshtein calculation algorithm can be used to determine typing errors or misspellings, words for which the proximity of the compared chains is strong.

Source code

dCode retains ownership of the online 'Levenshtein Distance' tool source code. Except explicit open source licence (indicated CC / Creative Commons / free), any 'Levenshtein Distance' algorithm, applet or snippet (converter, solver, encryption / decryption, encoding / decoding, ciphering / deciphering, translator), or any 'Levenshtein Distance' function (calculate, convert, solve, decrypt / encrypt, decipher / cipher, decode / encode, translate) written in any informatic language (Python, Java, PHP, C#, Javascript, Matlab, etc.) and no data download, script, copy-paste, or API access for 'Levenshtein Distance' will be for free, same for offline use on PC, tablet, iPhone or Android ! dCode is free and online.

Need Help ?

Please, check our dCode Discord community for help requests!
NB: for encrypted messages, test our automatic cipher identifier!

Questions / Comments

Thanks to your feedback and relevant comments, dCode has developed the best 'Levenshtein Distance' tool, so feel free to write! Thank you!


Source : https://www.dcode.fr/levenshtein-distance
© 2021 dCode — The ultimate 'toolkit' to solve every games / riddles / geocaching / CTF.
Feedback