| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| lmfao (0) - 1 freq lao (2) - 3 freq lbao (2) - 1 freq mao (2) - 2 freq mfaa (2) - 4 freq fao (2) - 20 freq lafan (2) - 1 freq lurno (3) - 1 freq apao (3) - 1 freq loff (3) - 2 freq mae (3) - 361 freq mfc (3) - 7 freq aafal (3) - 22 freq loo (3) - 29 freq amnae (3) - 2 freq lyan (3) - 29 freq umman (3) - 15 freq lina (3) - 1 freq lyfis (3) - 1 freq jfqo (3) - 1 freq zma (3) - 1 freq lof (3) - 1 freq may (3) - 449 freq imago (3) - 1 freq 'mo (3) - 3 freq |
lmfao (0) - 1 freq mfaa (3) - 4 freq lff (4) - 1 freq laf (4) - 1 freq lms (4) - 1 freq limo (4) - 9 freq laam (4) - 1 freq leam (4) - 17 freq lama (4) - 17 freq cumfae (4) - 2 freq leaf (4) - 40 freq loma (4) - 2 freq lyffe (4) - 3 freq lwf (4) - 1 freq leman (4) - 3 freq lyfe (4) - 44 freq lifie (4) - 5 freq lugfoo (4) - 1 freq mfi (4) - 1 freq comfae (4) - 1 freq lam (4) - 1 freq lf (4) - 5 freq leafa (4) - 63 freq liff (4) - 2 freq lamas (4) - 20 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 - LMF lmfao - 1 freq lmvh - 1 freq |
LMFAO |
| Time to execute Levenshtein function - 0.189573 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.357685 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.028602 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.037089 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.000919 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. |