| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| spam-block (0) - 1 freq peat-black (4) - 1 freq sun-bleck (4) - 1 freq shamrock (4) - 3 freq roadblock (4) - 3 freq coal-black (4) - 1 freq padlock (4) - 5 freq sea-loch (4) - 1 freq saut-brack (5) - 1 freq pauldock (5) - 1 freq parrock (5) - 2 freq warlock (5) - 43 freq headlock (5) - 1 freq blue-black (5) - 2 freq stammack (5) - 1 freq stark-bollock (5) - 1 freq shap-bocht (5) - 1 freq pollock (5) - 3 freq snapback (5) - 1 freq sillock (5) - 2 freq shamrocks (5) - 1 freq humplock (5) - 4 freq wadlock (5) - 1 freq tear-blobs (5) - 1 freq pan-loaf (5) - 4 freq |
spam-block (0) - 1 freq sun-bleck (6) - 1 freq peat-black (6) - 1 freq coal-black (7) - 1 freq jet-bleck (8) - 1 freq shambolic (8) - 4 freq grey-black (8) - 1 freq coll-black (8) - 1 freq jet-black (8) - 1 freq mirk-bleck (8) - 1 freq sate-back (8) - 1 freq publick (8) - 20 freq blue-black (8) - 2 freq pick-black (8) - 1 freq saut-brack (8) - 1 freq padlock (8) - 5 freq roadblock (8) - 3 freq shamrock (8) - 3 freq sea-loch (8) - 1 freq stamack (9) - 5 freq stamick (9) - 1 freq sherlock (9) - 7 freq splashback (9) - 1 freq shambles (9) - 30 freq payback (9) - 1 freq |
SoundEx code - S151 spoonfaes - 2 freq spuin-feedin - 1 freq spoonfuls - 1 freq spoonful - 2 freq speen-feedin - 2 freq spoonfu - 11 freq spoonfus - 1 freq spoon-feedin - 1 freq speenfu - 1 freq seiven'-but - 1 freq spuinfus - 1 freq spam-block - 1 freq schoppin-bag - 1 freq spuinfu - 1 freq suevmvcg - 1 freq sheepfanfaeely - 3 freq siobanvict - 1 freq spinfu - 1 freq |
MetaPhone code - SPMBLK spam-block - 1 freq |
SPAM-BLOCK |
| Time to execute Levenshtein function - 0.571417 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.916827 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.074537 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.055858 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.001144 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. |