| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| spammers (0) - 2 freq scammers (1) - 1 freq stammers (1) - 4 freq spanners (2) - 5 freq swimmers (2) - 2 freq slammer (2) - 1 freq hammers (2) - 6 freq stammer (2) - 1 freq yammers (2) - 3 freq stammert (2) - 2 freq slummers (2) - 1 freq spankers (2) - 2 freq summers (2) - 13 freq simmers (2) - 16 freq spaekers (2) - 39 freq spacers (2) - 2 freq spakers (2) - 4 freq spatters (2) - 4 freq slanders (3) - 1 freq slabbers (3) - 5 freq spaces (3) - 19 freq sparkes (3) - 1 freq simmerd (3) - 1 freq sayers (3) - 17 freq simmer's (3) - 29 freq |
spammers (0) - 2 freq scammers (2) - 1 freq stammers (2) - 4 freq summers (3) - 13 freq slummers (3) - 1 freq simmers (3) - 16 freq swimmers (3) - 2 freq spatters (4) - 4 freq spankers (4) - 2 freq spakers (4) - 4 freq spacers (4) - 2 freq spaekers (4) - 39 freq spanners (4) - 5 freq stammert (4) - 2 freq hammers (4) - 6 freq slammer (4) - 1 freq yammers (4) - 3 freq stammer (4) - 1 freq spikers (5) - 3 freq speeders (5) - 7 freq memmers (5) - 40 freq spiders (5) - 6 freq spars (5) - 6 freq suimmer (5) - 1 freq speers (5) - 7 freq |
SoundEx code - S156 seven-year - 2 freq souvenir - 5 freq submerged - 6 freq seiven-year - 1 freq spaniards - 1 freq submarine - 5 freq submarines - 3 freq spanner - 11 freq spanners - 5 freq shopowner - 1 freq souvenirs - 6 freq spooner - 1 freq skippin-rope - 1 freq spammers - 2 freq scvunnered - 1 freq spinner - 1 freq submerge - 1 freq spinyorra - 1 freq spaniard - 1 freq sgfwmrvscs - 1 freq |
MetaPhone code - SPMRS spammers - 2 freq |
SPAMMERS |
| Time to execute Levenshtein function - 0.240946 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.423321 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.029086 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.041347 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.000809 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. |