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

dCode and you

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!


Team dCode likes feedback and relevant comments; to get an answer give an email (not published). It is thanks to you that dCode has the best Levenshtein Distance tool. Thank you.

  >  [News]: Discover the next version of dCode Levenshtein Distance!

Levenshtein Distance

Sponsored ads

Distance Measurement






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.

Answers to Questions

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 source code of the script Levenshtein Distance online. Except explicit open source licence (indicated Creative Commons / free), any algorithm, applet, snippet, software (converter, solver, encryption / decryption, encoding / decoding, ciphering / deciphering, translator), or any function (convert, solve, decrypt, encrypt, decipher, cipher, decode, code, translate) written in any informatic langauge (PHP, Java, C#, Python, Javascript, Matlab, etc.) which dCode owns rights will not be given for free. To download the online Levenshtein Distance script for offline use on PC, iPhone or Android, ask for price quote on contact page !

Questions / Comments

  >  [News]: Discover the next version of dCode Levenshtein Distance!


Team dCode likes feedback and relevant comments; to get an answer give an email (not published). It is thanks to you that dCode has the best Levenshtein Distance tool. Thank you.


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