| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| miyybg (0) - 1 freq mig (3) - 2 freq mibby (3) - 27 freq mining (3) - 5 freq maybe (3) - 428 freq mayb (3) - 1 freq mixing (3) - 2 freq miynt (3) - 1 freq ming (3) - 12 freq miynd (3) - 1 freq miny (3) - 1 freq miyt (3) - 2 freq mibbe (3) - 372 freq ipyb (3) - 1 freq mi'be (3) - 6 freq mfotbg (3) - 1 freq iybv (3) - 2 freq mibbi (3) - 1 freq mibe (3) - 3 freq misyur (3) - 1 freq mibbbe (3) - 1 freq mily (3) - 2 freq minys (3) - 1 freq mired (4) - 2 freq misses (4) - 16 freq |
miyybg (0) - 1 freq mibe (4) - 3 freq ming (4) - 12 freq mibbi (4) - 1 freq mibbe (4) - 372 freq maybe (4) - 428 freq mibby (4) - 27 freq mayb (4) - 1 freq mig (4) - 2 freq midgie (5) - 27 freq maebbi (5) - 6 freq mgy (5) - 1 freq obg (5) - 1 freq mileage (5) - 7 freq mogg (5) - 2 freq mibee (5) - 16 freq mwg (5) - 1 freq mubba (5) - 1 freq mob (5) - 26 freq mcg (5) - 3 freq mibbee (5) - 7 freq mibey (5) - 1 freq marg (5) - 2 freq magog (5) - 1 freq bg (5) - 5 freq |
SoundEx code - M120 maybies - 1 freq muives - 8 freq mavis - 5 freq mebbies - 58 freq maps - 36 freq mebbes - 49 freq mibbies - 18 freq mebbe's - 1 freq maybes - 50 freq moves - 32 freq mibbes - 70 freq muffs - 1 freq mappey's - 1 freq mappies - 13 freq movies - 11 freq mibbys - 1 freq meeves - 1 freq mps - 31 freq muivs - 1 freq mfaa's - 1 freq movs - 2 freq maves - 8 freq mavis' - 2 freq mavis's - 1 freq €œmibbies - 2 freq €˜mibbies - 1 freq meps - 3 freq mavies - 1 freq moufus - 1 freq muves - 1 freq €œmaybes - 9 freq mp's - 3 freq mibees - 3 freq mpvz - 1 freq mvsh - 1 freq mefq - 1 freq mpq - 1 freq mufc - 8 freq mbjs - 1 freq miovski - 2 freq mfc - 7 freq mbs - 2 freq mpÂ’s - 1 freq mvpxyy - 1 freq mbes - 1 freq mhvq - 1 freq miyybg - 1 freq mvpyx - 1 freq mbwx - 1 freq mnbxszq - 1 freq mvk - 1 freq mffke - 1 freq maybees - 1 freq |
MetaPhone code - MBK miyybg - 1 freq |
MIYYBG |
| Time to execute Levenshtein function - 0.239486 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.421837 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.030327 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.042347 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.005736 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. |