| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| slammin (0) - 18 freq shammin (1) - 1 freq slimmin (1) - 4 freq slammit (1) - 1 freq glammin (1) - 3 freq slammen (1) - 1 freq lammin (1) - 2 freq spammin (1) - 1 freq slammt (2) - 1 freq glimmin (2) - 1 freq rammin (2) - 3 freq slaikin (2) - 2 freq slammed (2) - 22 freq brammin (2) - 1 freq flamin (2) - 20 freq slashin (2) - 3 freq slavin (2) - 10 freq slumpin (2) - 3 freq samain (2) - 1 freq bammin (2) - 3 freq sclimmin (2) - 18 freq slawin (2) - 2 freq slain (2) - 9 freq sammi (2) - 1 freq blimmin (2) - 2 freq |
slammin (0) - 18 freq slammen (1) - 1 freq slimmin (1) - 4 freq spammin (2) - 1 freq shammin (2) - 1 freq lammin (2) - 2 freq slammit (2) - 1 freq glammin (2) - 3 freq blimmin (3) - 2 freq slammer (3) - 1 freq sclimmin (3) - 18 freq stemmin (3) - 2 freq swimmin (3) - 61 freq flemmin (3) - 2 freq skimmin (3) - 4 freq summin (3) - 36 freq sklimmin (3) - 4 freq climmin (3) - 16 freq sloomin (3) - 1 freq glimmin (3) - 1 freq sloumin (3) - 4 freq slammed (3) - 22 freq slammt (3) - 1 freq slumpin (3) - 3 freq clammit (4) - 1 freq |
SoundEx code - S455 sclimmin - 18 freq slammin - 18 freq salmon - 46 freq salmon-leap - 1 freq slamannan - 1 freq saulmon - 1 freq solomon's - 2 freq solomons - 2 freq solomon - 32 freq slammen - 1 freq salamanca - 1 freq salmond - 24 freq 'salmon-ella' - 1 freq slimmin - 4 freq salmonella - 3 freq skaeliment - 1 freq sloumin - 4 freq sklimmin - 4 freq sloomin - 1 freq sclimin - 1 freq soleman - 2 freq |
MetaPhone code - SLMN slammin - 18 freq solemn - 25 freq salmon - 46 freq saulmon - 1 freq solomon - 32 freq slammen - 1 freq slimmin - 4 freq sloumin - 4 freq solumn - 1 freq sloomin - 1 freq soleman - 2 freq |
SLAMMIN |
| Time to execute Levenshtein function - 0.181752 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.333752 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.027782 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.037255 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.000837 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. |