| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| lanyon (0) - 1 freq landon (1) - 2 freq canyon (1) - 1 freq lundon (2) - 2 freq lyon (2) - 2 freq wanton (2) - 2 freq lann (2) - 1 freq lagoon (2) - 5 freq lannot (2) - 4 freq canton (2) - 2 freq lonnon (2) - 1 freq layan (2) - 1 freq kenyon (2) - 1 freq oanyone (2) - 1 freq danson (2) - 1 freq latyn (2) - 1 freq lanyon's (2) - 1 freq cannon (2) - 13 freq hanlon (2) - 2 freq london (2) - 182 freq langin (2) - 7 freq layen (2) - 2 freq lannin (2) - 2 freq lennon (2) - 10 freq landin (2) - 45 freq |
lanyon (0) - 1 freq lann (2) - 1 freq landon (2) - 2 freq canyon (2) - 1 freq lankan (3) - 2 freq lando (3) - 1 freq linn (3) - 26 freq canon (3) - 11 freq 'anyone (3) - 1 freq anyun (3) - 1 freq lyndon (3) - 7 freq loanen (3) - 22 freq launin (3) - 1 freq landen (3) - 1 freq anyone (3) - 67 freq laenan (3) - 1 freq leanan (3) - 4 freq laanen (3) - 2 freq linen (3) - 26 freq lunan (3) - 1 freq lynen (3) - 1 freq leanin (3) - 49 freq linin (3) - 10 freq lenn (3) - 2 freq lynn (3) - 1 freq |
SoundEx code - L550 lunnon - 33 freq leanin - 49 freq leamin - 12 freq linen - 26 freq lemon - 23 freq loanin - 11 freq loomin - 9 freq lammin - 2 freq loanen - 22 freq linin - 10 freq laanen - 2 freq lemen - 1 freq leenen - 1 freq lynen - 1 freq leenin - 8 freq launin - 1 freq lunan - 1 freq lennon - 10 freq linnin - 2 freq liinnin - 1 freq léman' - 3 freq lennin - 2 freq lannin - 2 freq louman - 1 freq looman - 1 freq leanan - 4 freq laenan - 1 freq lineen - 1 freq lownin - 2 freq lumen - 1 freq leman - 3 freq leonine - 1 freq lömin - 1 freq lynin - 1 freq limnin - 1 freq laymen - 1 freq lonnon - 1 freq lenin - 1 freq lanyon - 1 freq lyinin - 1 freq linnean - 1 freq lunnin - 1 freq linin - 1 freq lemmon - 1 freq lnemhy - 1 freq lemony - 1 freq 'lennon' - 1 freq |
MetaPhone code - LNYN lanyon - 1 freq |
LANYON |
| Time to execute Levenshtein function - 0.296449 milliseconds The Levenshtein distance is the number of characters you have to replace, insert or delete to transform one word into another, its useful for detecting typos and alternative spellings |
Time to execute Double Levenshtein function - 0.419450 milliseconds In a stroke of genius, this runs the Levenshtein function twice, once without vowels and adds the distance together, giving double weight to consonants. |
Time to execute SoundEx function - 0.027631 milliseconds Soundex is a phonetic algorithm for indexing names by sound, as pronounced in English. The goal is for homophones to be encoded to the same representation so that they can be matched despite minor differences in spelling. |
Time to execute MetaPhone function - 0.039454 milliseconds Metaphone is a phonetic algorithm, published by Lawrence Philips in 1990, for indexing words by their English pronunciation.[1] It fundamentally improves on the Soundex algorithm by using information about variations and inconsistencies in English spelling and pronunciation to produce a more accurate encoding, which does a better job of matching words and names which sound similar. |
Time to execute Manually curated function - 0.000969 milliseconds Manual Curation uses a lookup table / lexicon which has been created by hand which links words to their lemmas, and includes obvious typos and spelling variations. Not all words are covered. |