| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| limb (0) - 14 freq limbs (1) - 41 freq lima (1) - 2 freq limp (1) - 20 freq lims (1) - 2 freq lamb (1) - 63 freq limo (1) - 9 freq lib (1) - 13 freq limn (1) - 2 freq lime (1) - 29 freq climb (1) - 58 freq jimp (2) - 34 freq rims (2) - 3 freq lint (2) - 17 freq lic (2) - 1 freq lis (2) - 1 freq lice (2) - 7 freq lidd (2) - 2 freq lamh (2) - 1 freq limps (2) - 1 freq lits (2) - 15 freq hib (2) - 1 freq lili (2) - 2 freq nitb (2) - 1 freq womb (2) - 8 freq |
limb (0) - 14 freq lamb (1) - 63 freq limn (2) - 2 freq lime (2) - 29 freq climb (2) - 58 freq lambo (2) - 1 freq lib (2) - 13 freq limbie (2) - 1 freq lima (2) - 2 freq limo (2) - 9 freq limbs (2) - 41 freq lims (2) - 2 freq limp (2) - 20 freq plumb (3) - 1 freq lyme (3) - 1 freq lam (3) - 1 freq gmb (3) - 4 freq somb (3) - 1 freq caimb (3) - 9 freq lumn (3) - 1 freq lxb (3) - 1 freq lwb (3) - 1 freq lm (3) - 5 freq lambs (3) - 57 freq jimbo (3) - 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 - LM lum - 140 freq liam - 31 freq leam - 17 freq luim - 6 freq lima - 2 freq lammie - 8 freq limb - 14 freq lamb - 63 freq lm - 5 freq lame - 10 freq lime - 29 freq loam - 5 freq lambie - 3 freq loom - 14 freq laam - 1 freq 'lamb - 1 freq 'lm - 1 freq limo - 9 freq lym - 1 freq loma - 2 freq lame' - 1 freq lem - 5 freq lamm - 3 freq laem - 1 freq lemm - 2 freq lume - 1 freq lyme - 1 freq lemme - 4 freq lama - 17 freq limbie - 1 freq leim - 2 freq hlmm - 1 freq lamh - 1 freq lambo - 1 freq lumi - 2 freq limmy - 2 freq lam - 1 freq |
LIMB |
| Time to execute Levenshtein function - 0.181502 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.359139 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.027191 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.036982 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. |