| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| launfaa (0) - 2 freq sunfaa (2) - 1 freq haunfae (2) - 9 freq laufan (2) - 1 freq haunfa (2) - 1 freq launcht (3) - 1 freq haunful (3) - 1 freq an-aa (3) - 7 freq lahndan (3) - 1 freq laura (3) - 190 freq launer (3) - 1 freq gaunnae (3) - 135 freq haunfu (3) - 8 freq laffan (3) - 1 freq lauras (3) - 4 freq lunan (3) - 1 freq launward (3) - 1 freq an'aa (3) - 3 freq gaunna (3) - 3 freq mauna (3) - 8 freq maunae (3) - 2 freq laun's (3) - 2 freq maunna (3) - 43 freq laundin (3) - 14 freq hairfaa (3) - 1 freq |
launfaa (0) - 2 freq lounfu (3) - 1 freq haunfa (3) - 1 freq sunfaa (3) - 1 freq haunfae (3) - 9 freq laun (4) - 76 freq laund (4) - 89 freq doonfaa (4) - 3 freq lanlay (4) - 2 freq laenan (4) - 1 freq launs (4) - 17 freq launin (4) - 1 freq lawfae (4) - 2 freq launce (4) - 1 freq lunan (4) - 1 freq lunar (4) - 1 freq hanfae (4) - 3 freq haanfae (4) - 6 freq laufan (4) - 1 freq langa (4) - 1 freq luna (4) - 2 freq haunfu (4) - 8 freq launer (4) - 1 freq lanka (4) - 7 freq lndia (5) - 1 freq |
SoundEx code - L510 lump - 62 freq lamp - 79 freq limp - 20 freq limb - 14 freq lamb - 63 freq lambie - 3 freq launfaa - 2 freq 'lamb - 1 freq loompa - 1 freq lounfu - 1 freq lumpy - 4 freq line-up - 4 freq lanewife - 1 freq limbie - 1 freq lineup - 1 freq lambo - 1 freq lmfao - 1 freq lmvh - 1 freq |
MetaPhone code - LNF lonagh - 1 freq launfaa - 2 freq lounfu - 1 freq |
LAUNFAA |
| Time to execute Levenshtein function - 0.239682 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.412199 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.029965 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.038882 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.000974 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. |