| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| mvk (0) - 1 freq xvk (1) - 1 freq mvd (1) - 1 freq mk (1) - 1 freq mak (1) - 2579 freq vk (1) - 5 freq avk (1) - 10 freq mek (1) - 1 freq mve (1) - 1 freq mik (1) - 1 freq mgk (1) - 1 freq mck (1) - 2 freq vvk (1) - 1 freq mv (1) - 2 freq myn (2) - 128 freq min (2) - 511 freq pk (2) - 4 freq ezk (2) - 1 freq mor (2) - 15 freq cv (2) - 4 freq vbk (2) - 2 freq mnz (2) - 5 freq mj (2) - 6 freq bv (2) - 2 freq lyk (2) - 16 freq |
mvk (0) - 1 freq mgk (2) - 1 freq mik (2) - 1 freq vvk (2) - 1 freq mv (2) - 2 freq xvk (2) - 1 freq mve (2) - 1 freq mck (2) - 2 freq mek (2) - 1 freq mvd (2) - 1 freq mk (2) - 1 freq mak (2) - 2579 freq vk (2) - 5 freq avk (2) - 10 freq move (3) - 307 freq mask (3) - 71 freq make (3) - 622 freq emva (3) - 1 freq mark (3) - 222 freq mulk (3) - 27 freq milk (3) - 243 freq muck (3) - 67 freq moka (3) - 1 freq meek (3) - 6 freq puvk (3) - 1 freq |
SoundEx code - M120 maybies - 1 freq muives - 8 freq mavis - 5 freq mebbies - 58 freq maps - 36 freq mebbes - 45 freq mibbies - 18 freq mebbe's - 1 freq maybes - 50 freq moves - 34 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 - MFK mefq - 1 freq mufc - 8 freq mfc - 7 freq mhvq - 1 freq mvk - 1 freq mffke - 1 freq |
MVK |
| Time to execute Levenshtein function - 0.242363 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.388414 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.032397 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.049142 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.000883 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. |