| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| liwuplxrqr (0) - 1 freq liqueur (6) - 2 freq figurr (6) - 2 freq lindexer (6) - 6 freq lippert (6) - 1 freq swulter (6) - 1 freq lipperan (6) - 2 freq eodsylyrqr (6) - 1 freq linklater (6) - 2 freq limpar (6) - 1 freq liquor (6) - 7 freq lippers (6) - 9 freq explorer (6) - 1 freq midulster (6) - 1 freq lowurd (6) - 1 freq simpler (6) - 4 freq lipper (6) - 14 freq ivulxy (6) - 1 freq law-plea (6) - 2 freq librar (6) - 8 freq likelier (6) - 1 freq lipperin (6) - 8 freq wulver (6) - 1 freq literar (6) - 3 freq lewmpgxkiz (6) - 1 freq |
liwuplxrqr (0) - 1 freq explorer (10) - 1 freq zqxrqr (10) - 1 freq lawlier (10) - 1 freq eodsylyrqr (10) - 1 freq lawlords (10) - 1 freq lipliners (10) - 1 freq livelier (11) - 1 freq limply (11) - 2 freq lawlander (11) - 1 freq wurr (11) - 27 freq lippered (11) - 2 freq liper (11) - 1 freq littler (11) - 1 freq lippert (11) - 1 freq lindexer (11) - 6 freq pleurer (11) - 1 freq pylqzqr (11) - 1 freq liqueur (11) - 2 freq lipperan (11) - 2 freq i-player (11) - 2 freq iplayer (11) - 5 freq lowlander (11) - 1 freq implore (11) - 1 freq imperor (11) - 3 freq |
SoundEx code - L142 labels - 6 freq leafless - 4 freq love-light - 1 freq levels - 66 freq luveless - 1 freq loveliest - 6 freq loveless - 1 freq lifeless - 7 freq luvlies - 1 freq lapels - 1 freq level-crossin - 1 freq levels' - 1 freq lifelessness - 1 freq lyfie-lik - 1 freq leevils - 1 freq leevels - 1 freq leaf-lik - 1 freq levils - 1 freq liwuplxrqr - 1 freq levels - 1 freq leavealightonforscotland - 1 freq loopholes - 1 freq |
MetaPhone code - LWPLKSRK |
LIWUPLXRQR |
| Time to execute Levenshtein function - 0.223129 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.401241 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.028036 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.037323 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.000932 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. |