| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| gamblin (0) - 9 freq gammlin (1) - 5 freq gambling (1) - 3 freq ramblin (1) - 4 freq gemblin (1) - 1 freq gabblin (1) - 4 freq wamblin (1) - 1 freq amblin (1) - 3 freq gambled (2) - 1 freq gambler (2) - 4 freq babblin (2) - 2 freq gamblin's (2) - 1 freq grabblin (2) - 1 freq wabblin (2) - 5 freq wammlin (2) - 6 freq lambin (2) - 19 freq nabblin (2) - 1 freq garglin (2) - 2 freq cablin (2) - 1 freq raiblin (2) - 1 freq gabbling (2) - 1 freq gabbin (2) - 19 freq warblin (2) - 1 freq humblin (2) - 1 freq goblin (2) - 9 freq |
gamblin (0) - 9 freq gemblin (1) - 1 freq gabblin (2) - 4 freq amblin (2) - 3 freq wamblin (2) - 1 freq ramblin (2) - 4 freq gammlin (2) - 5 freq gambling (2) - 3 freq gorblin (3) - 2 freq gambles (3) - 2 freq gamble (3) - 13 freq humblin (3) - 1 freq grumblin (3) - 1 freq gobblin (3) - 1 freq mumblin (3) - 2 freq gambler (3) - 4 freq gambled (3) - 1 freq goblin (3) - 9 freq tumblin (3) - 5 freq fumblin (3) - 1 freq rumblin (3) - 12 freq gamin (4) - 3 freq tumblan (4) - 2 freq gambol (4) - 1 freq mumblan (4) - 1 freq |
SoundEx code - G514 gamblin - 9 freq gambol - 1 freq gamblers - 4 freq gamble - 13 freq gamblin's - 1 freq gambler - 4 freq gambling - 3 freq genuflectin - 1 freq genepöls - 1 freq gemblin - 1 freq gambled - 1 freq gambles - 2 freq |
MetaPhone code - KMLN gamblin - 9 freq gammlin - 5 freq camelon - 7 freq kumlieni - 1 freq |
GAMBLIN |
| Time to execute Levenshtein function - 0.191658 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.377221 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.027219 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.038066 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.000937 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. |