| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| wammlin (0) - 6 freq whammlin (1) - 1 freq wummlin (1) - 1 freq gammlin (1) - 5 freq wamblin (1) - 1 freq wammilin (1) - 1 freq waummlin (1) - 1 freq rammlin (1) - 2 freq waamin (2) - 1 freq wummin (2) - 231 freq ramblin (2) - 4 freq amblin (2) - 2 freq whummlin (2) - 2 freq rummlin (2) - 23 freq waddlin (2) - 2 freq fummlin (2) - 4 freq warmlie (2) - 3 freq wagglin (2) - 3 freq whammlins (2) - 1 freq jammin (2) - 4 freq rammin (2) - 3 freq hammin (2) - 1 freq waalin (2) - 1 freq bummlin (2) - 2 freq warslin (2) - 17 freq |
wammlin (0) - 6 freq waummlin (1) - 1 freq wummlin (1) - 1 freq wammilin (1) - 1 freq rammlin (2) - 2 freq wamblin (2) - 1 freq whammlin (2) - 1 freq gammlin (2) - 5 freq tummlin (3) - 25 freq wimmin (3) - 31 freq wammled (3) - 5 freq jummlin (3) - 1 freq mummlin (3) - 7 freq bummlin (3) - 2 freq wamman (3) - 1 freq wammle (3) - 2 freq wimplin (3) - 6 freq fummlin (3) - 4 freq wummin (3) - 231 freq whummlin (3) - 2 freq rummlin (3) - 23 freq rummlan (4) - 1 freq tummlan (4) - 1 freq waamin (4) - 1 freq ramblin (4) - 4 freq |
SoundEx code - W545 wammlin - 6 freq wammilin - 1 freq whammlins - 1 freq whummlins - 1 freq whummlin - 2 freq waummlin - 1 freq wummlin - 1 freq whammlin - 1 freq weonlywon - 1 freq |
MetaPhone code - WMLN wammlin - 6 freq wamblin - 1 freq wammilin - 1 freq whummlin - 2 freq waummlin - 1 freq wummlin - 1 freq whammlin - 1 freq |
WAMMLIN |
| Time to execute Levenshtein function - 0.191610 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.389365 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.027669 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.037901 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.000870 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. |