| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| wampishin (0) - 1 freq warnishin (2) - 3 freq wampish (2) - 1 freq ramshin (3) - 3 freq waistin (3) - 1 freq jamphin (3) - 1 freq waashin (3) - 29 freq washin (3) - 85 freq pishin (3) - 32 freq ambushin (3) - 1 freq amaisin (3) - 1 freq manishin (3) - 1 freq wishin (3) - 38 freq faimishin (3) - 1 freq wairnishin (3) - 1 freq wammilin (3) - 1 freq warnishins (3) - 2 freq wameskin (3) - 1 freq vanishin (3) - 5 freq humfishin (3) - 1 freq vainishin (3) - 4 freq waidgin (4) - 1 freq virmishin (4) - 2 freq pissin (4) - 17 freq publishin (4) - 21 freq |
wampishin (0) - 1 freq wampish (3) - 1 freq warnishin (4) - 3 freq faimishin (5) - 1 freq wishin (5) - 38 freq wairnishin (5) - 1 freq humfishin (5) - 1 freq ambushin (5) - 1 freq wameskin (5) - 1 freq manishin (5) - 1 freq ramshin (5) - 3 freq jamphin (5) - 1 freq waashin (5) - 29 freq washin (5) - 85 freq pishin (5) - 32 freq diminishin (6) - 5 freq smushin (6) - 4 freq hampshire (6) - 1 freq wuishen (6) - 1 freq imposin (6) - 4 freq wimperin (6) - 1 freq waashan (6) - 1 freq wishen (6) - 2 freq dumpish (6) - 1 freq mumphin (6) - 1 freq |
SoundEx code - W512 winnipeg - 1 freq wimps - 1 freq wampishin - 1 freq wannabees - 3 freq whin-bush - 1 freq wampish - 1 freq whinbush - 1 freq wimpykid - 3 freq wwnvbgkiy - 1 freq wmbps - 1 freq win-fucking-dow - 1 freq |
MetaPhone code - WMPXN wampishin - 1 freq |
WAMPISHIN |
| Time to execute Levenshtein function - 0.225350 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.404173 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.028531 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.050979 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.001236 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. |