Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
---|---|---|---|---|
madman (0) - 7 freq madmen (1) - 1 freq barman (2) - 25 freq harman (2) - 1 freq madram (2) - 1 freq maan (2) - 153 freq taxman (2) - 2 freq wamman (2) - 1 freq madden (2) - 3 freq gazman (2) - 1 freq fatman (2) - 1 freq caiman (2) - 1 freq madlad (2) - 1 freq mamam (2) - 1 freq magma (2) - 3 freq roadman (2) - 3 freq jakman (2) - 2 freq mammal (2) - 2 freq makan (2) - 21 freq cayman (2) - 1 freq hodman (2) - 1 freq mamen (2) - 16 freq mammon (2) - 6 freq markan (2) - 1 freq fadan (2) - 1 freq |
madman (0) - 7 freq madmen (1) - 1 freq mammon (3) - 6 freq madam (3) - 19 freq roadman (3) - 3 freq hodman (3) - 1 freq mdma (3) - 3 freq mamen (3) - 16 freq madden (3) - 3 freq madigan (3) - 1 freq admin (3) - 5 freq amadan (3) - 1 freq midian (3) - 1 freq moonman (4) - 2 freq midden (4) - 92 freq madainn (4) - 1 freq mideen (4) - 1 freq modern (4) - 149 freq umman (4) - 15 freq damn (4) - 73 freq madampe (4) - 1 freq maakan (4) - 4 freq maiden (4) - 18 freq madkeen (4) - 1 freq moomin (4) - 1 freq |
SoundEx code - M355 mydnins - 1 freq madman - 7 freq motionin - 1 freq madmen - 1 freq maidment - 2 freq mid-nineteenth - 1 freq maddening - 1 freq madmentaltim - 2 freq maddnin - 1 freq |
MetaPhone code - MTMN madman - 7 freq madmen - 1 freq |
MADMAN |
Time to execute Levenshtein function - 0.182351 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.371636 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.029658 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.038962 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.000979 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. |