| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| leaf-lik (0) - 1 freq delf-lik (2) - 1 freq leafully (3) - 1 freq sac-lik (3) - 1 freq sae-lik (3) - 2 freq soar-lik (3) - 1 freq leafin (3) - 3 freq leakylike (3) - 1 freq lea-rig (3) - 2 freq saft-lik (3) - 1 freq slaw-lik (3) - 1 freq daft-lik (3) - 2 freq wean-like (3) - 1 freq gah-lik (3) - 1 freq leaflet (3) - 11 freq gay-lik (3) - 1 freq learntit (4) - 1 freq yearbuik (4) - 1 freq deafie (4) - 3 freq lea'in (4) - 1 freq waa-like (4) - 1 freq quatelik (4) - 1 freq traffik (4) - 1 freq menfolk (4) - 1 freq hafolk (4) - 1 freq |
leaf-lik (0) - 1 freq delf-lik (3) - 1 freq lyfie-lik (4) - 1 freq daft-lik (5) - 2 freq slaw-lik (5) - 1 freq gah-lik (5) - 1 freq gay-lik (5) - 1 freq saft-lik (5) - 1 freq wean-like (5) - 1 freq leaflet (5) - 11 freq sac-lik (5) - 1 freq ill-lik (5) - 1 freq sae-lik (5) - 2 freq leafully (5) - 1 freq leakylike (5) - 1 freq soar-lik (5) - 1 freq gleyt-like (6) - 1 freq saw-like (6) - 1 freq sun-lik (6) - 1 freq hauf-lit (6) - 4 freq leftley (6) - 3 freq nate-lik (6) - 1 freq leddy-like (6) - 1 freq awfy-like (6) - 1 freq law-lyin (6) - 1 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 - LFLK lyfie-lik - 1 freq leaf-lik - 1 freq |
LEAF-LIK |
| Time to execute Levenshtein function - 0.177762 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.397552 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.028614 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.038678 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.000894 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. |