| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| unlimited (0) - 21 freq oonlimited (2) - 1 freq limited (2) - 19 freq united (3) - 75 freq uplifted (3) - 3 freq unmerited (3) - 1 freq enlisted (3) - 1 freq unrimed (3) - 1 freq unified (3) - 3 freq animated (3) - 5 freq uninvited (3) - 3 freq uncried (4) - 1 freq knitted (4) - 13 freq ultimate (4) - 11 freq lamiter (4) - 1 freq unfinished (4) - 2 freq unloaded (4) - 1 freq sklimmed (4) - 3 freq enlichten (4) - 3 freq unbiased (4) - 3 freq inflicted (4) - 1 freq unwanted (4) - 6 freq unpikit (4) - 1 freq publicised (4) - 1 freq exhibited (4) - 1 freq |
unlimited (0) - 21 freq oonlimited (2) - 1 freq limited (3) - 19 freq enlisted (4) - 1 freq animated (4) - 5 freq unmerited (5) - 1 freq leemited (5) - 1 freq united (5) - 75 freq uninvited (5) - 3 freq unelected (5) - 1 freq uplifted (5) - 3 freq unrimed (5) - 1 freq glimped (6) - 2 freq vomited (6) - 4 freq unairmed (6) - 1 freq intimidated (6) - 1 freq unrelated (6) - 2 freq climbed (6) - 33 freq obligated (6) - 1 freq unbolted (6) - 1 freq ingited (6) - 1 freq blirted (6) - 1 freq unlozened (6) - 1 freq limned (6) - 1 freq intimate (6) - 10 freq |
SoundEx code - U545 unweelness - 1 freq 'unweelness' - 1 freq unwillint - 1 freq unalane - 1 freq unlimited - 21 freq unwillin - 7 freq unwillingness - 1 freq unlandit - 1 freq unweillness - 1 freq unlamentit - 1 freq unwullant - 1 freq unlamentin - 1 freq unwilling - 1 freq |
MetaPhone code - UNLMTT unlimited - 21 freq |
UNLIMITED |
| Time to execute Levenshtein function - 0.203710 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.351719 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.030622 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.039430 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.000866 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. |