| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| limbed (0) - 1 freq limber (1) - 2 freq limned (1) - 1 freq limped (1) - 1 freq lambed (1) - 2 freq libbed (1) - 1 freq climbed (1) - 33 freq aimed (2) - 16 freq climb'd (2) - 1 freq nimed (2) - 1 freq lime (2) - 29 freq limited (2) - 20 freq linned (2) - 2 freq combed (2) - 3 freq caimbed (2) - 3 freq lumped (2) - 2 freq limbie (2) - 1 freq lumber (2) - 5 freq limpet (2) - 5 freq mimed (2) - 3 freq rimed (2) - 1 freq lambeg (2) - 5 freq lined (2) - 51 freq climped (2) - 1 freq lisped (2) - 1 freq |
limbed (0) - 1 freq lambed (1) - 2 freq climbed (2) - 33 freq limber (2) - 2 freq libbed (2) - 1 freq limned (2) - 1 freq limped (2) - 1 freq lumed (3) - 1 freq limbs (3) - 41 freq lumber (3) - 5 freq lambeg (3) - 5 freq lobbed (3) - 6 freq limbie (3) - 1 freq lummed (3) - 2 freq lamped (3) - 2 freq imbued (3) - 1 freq lumped (3) - 2 freq limited (3) - 20 freq limb (3) - 14 freq embed (3) - 2 freq bombed (3) - 7 freq numbed (3) - 4 freq combed (3) - 3 freq caimbed (3) - 3 freq i'bed (4) - 1 freq |
SoundEx code - L513 limbed - 1 freq lamb-pot - 1 freq lambed - 2 freq lempets - 2 freq limpet - 5 freq lampit - 2 freq lamped - 2 freq limpets - 2 freq limpits - 1 freq lumped - 2 freq lumpots - 1 freq lempit - 2 freq lumpit - 1 freq limped - 1 freq lo-an-behaud - 1 freq limpit - 1 freq |
MetaPhone code - LMT loomit - 4 freq loomed - 5 freq leamed - 4 freq limit - 27 freq limbed - 1 freq lummed - 2 freq lambed - 2 freq leemit - 14 freq lumed - 1 freq leimit - 1 freq |
LIMBED |
| Time to execute Levenshtein function - 0.731833 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.882184 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.028323 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.086052 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.001113 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. |