| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| snawman (0) - 10 freq snowman (1) - 2 freq snawmen (1) - 1 freq snowmen (2) - 1 freq snawin (2) - 6 freq naaman (2) - 2 freq snawbaw (2) - 20 freq snawba (2) - 25 freq newman (2) - 20 freq snawbaa (2) - 2 freq snawinan (2) - 1 freq showman (2) - 4 freq spaeman (2) - 1 freq seaman (2) - 4 freq sawtan (2) - 1 freq €˜snawmen (3) - 1 freq snakin (3) - 2 freq stannan (3) - 4 freq spaekan (3) - 32 freq shakkan (3) - 3 freq namin (3) - 6 freq knawn (3) - 6 freq swayan (3) - 7 freq snaar (3) - 1 freq swawin (3) - 2 freq |
snawman (0) - 10 freq snawmen (1) - 1 freq snowman (1) - 2 freq snowmen (2) - 1 freq snawinan (3) - 1 freq newman (3) - 20 freq snawin (3) - 6 freq showman (3) - 4 freq snowkin (4) - 7 freq snawline (4) - 1 freq sweeman (4) - 3 freq sawtan (4) - 1 freq snowin (4) - 4 freq spaeman (4) - 1 freq seaman (4) - 4 freq snawbaw (4) - 20 freq naaman (4) - 2 freq snawbaa (4) - 2 freq snawba (4) - 25 freq spaemen (5) - 3 freq samen (5) - 35 freq salmon (5) - 46 freq skimman (5) - 1 freq snappin (5) - 15 freq staemin (5) - 1 freq |
SoundEx code - S555 synonyms - 3 freq snawmen - 1 freq summonin - 1 freq samen-nems - 1 freq summonan - 1 freq snowmen - 1 freq snawman - 10 freq €˜snawmen - 1 freq snawmannies - 1 freq snawinan - 1 freq snaw-mannie - 1 freq synonymous - 2 freq semi-anonymously - 2 freq someman - 1 freq snowman - 2 freq shonamain - 8 freq simonmount - 3 freq |
MetaPhone code - SNMN snawmen - 1 freq cinnamon - 5 freq snowmen - 1 freq snawman - 10 freq €˜snawmen - 1 freq snaw-mannie - 1 freq snowman - 2 freq |
SNAWMAN |
| Time to execute Levenshtein function - 0.178533 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.356783 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.027424 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.037062 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.000866 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. |