| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| lananin (0) - 1 freq lannin (1) - 2 freq lennin (2) - 2 freq flannin (2) - 1 freq leanin (2) - 49 freq plannin (2) - 54 freq laangin (2) - 2 freq fannin (2) - 9 freq mannin (2) - 1 freq haanin (2) - 1 freq aanin (2) - 2 freq launin (2) - 1 freq lairnin (2) - 185 freq laanen (2) - 2 freq landin (2) - 45 freq loanin (2) - 11 freq vannin (2) - 1 freq laandin (2) - 1 freq bannin (2) - 5 freq langin (2) - 7 freq hannin (2) - 3 freq lunnin (2) - 1 freq kanani (2) - 1 freq laitnin (2) - 1 freq laernin (2) - 5 freq |
lananin (0) - 1 freq lannin (1) - 2 freq linnin (2) - 2 freq lunnin (2) - 1 freq lennin (2) - 2 freq lankin (3) - 1 freq liinnin (3) - 1 freq cannin (3) - 3 freq laitnin (3) - 1 freq lannit (3) - 3 freq laernin (3) - 5 freq lunnon (3) - 33 freq lennon (3) - 10 freq lonnon (3) - 1 freq tannin (3) - 12 freq langin (3) - 7 freq pannin (3) - 2 freq larnin (3) - 27 freq hannin (3) - 3 freq bannin (3) - 5 freq launin (3) - 1 freq plannin (3) - 54 freq mannin (3) - 1 freq laangin (3) - 2 freq fannin (3) - 9 freq |
SoundEx code - L555 lananin - 1 freq liniment - 1 freq lineman - 2 freq |
MetaPhone code - LNNN lananin - 1 freq |
LANANIN |
| Time to execute Levenshtein function - 0.237420 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.370722 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.027904 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.038010 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.000876 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. |