Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
---|---|---|---|---|
gammlin (0) - 5 freq gamblin (1) - 9 freq rammlin (1) - 2 freq wammlin (1) - 6 freq gampin (2) - 1 freq bummlin (2) - 2 freq grummlin (2) - 7 freq wammilin (2) - 1 freq mummlin (2) - 7 freq wummlin (2) - 1 freq gamin (2) - 3 freq bammin (2) - 3 freq gemmin (2) - 1 freq hammin (2) - 1 freq samplin (2) - 2 freq gambling (2) - 3 freq fummlin (2) - 4 freq waummlin (2) - 1 freq grumlin (2) - 1 freq whammlin (2) - 1 freq tummlin (2) - 26 freq ramblin (2) - 4 freq jammin (2) - 4 freq lammin (2) - 2 freq gummin (2) - 1 freq |
gammlin (0) - 5 freq rammlin (2) - 2 freq wammlin (2) - 6 freq gamblin (2) - 9 freq waummlin (3) - 1 freq fummlin (3) - 4 freq gemblin (3) - 1 freq grumlin (3) - 1 freq gammon (3) - 5 freq gummin (3) - 1 freq jummlin (3) - 1 freq tummlin (3) - 26 freq gremlin (3) - 4 freq wammilin (3) - 1 freq grummlin (3) - 7 freq bummlin (3) - 2 freq mummlin (3) - 7 freq wummlin (3) - 1 freq gemmin (3) - 1 freq rummlin (3) - 24 freq crammlin (4) - 1 freq grummilin (4) - 1 freq rammin (4) - 3 freq mummilin (4) - 1 freq tummlan (4) - 1 freq |
SoundEx code - G545 gammlin - 5 freq gainnlin - 1 freq |
MetaPhone code - KMLN gamblin - 9 freq gammlin - 5 freq camelon - 7 freq kumlieni - 1 freq |
GAMMLIN |
Time to execute Levenshtein function - 0.452684 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.608841 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.041407 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.075975 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.000823 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. |