| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| mxvf (0) - 1 freq mx (2) - 6 freq mzva (2) - 1 freq xxv (2) - 2 freq mtv (2) - 2 freq mave (2) - 1 freq mgv (2) - 1 freq mef (2) - 2 freq mve (2) - 1 freq mvk (2) - 1 freq mxyu (2) - 1 freq msxv (2) - 1 freq move (2) - 314 freq pvf (2) - 1 freq jxvp (2) - 1 freq mcf (2) - 3 freq vf (2) - 1 freq munf (2) - 1 freq mxj (2) - 1 freq xcf (2) - 1 freq xxvi (2) - 1 freq movs (2) - 2 freq xvi (2) - 3 freq xvk (2) - 1 freq xv (2) - 6 freq |
mxvf (0) - 1 freq muv (4) - 1 freq luvf (4) - 1 freq kxf (4) - 1 freq mpvz (4) - 1 freq qyvf (4) - 1 freq maif (4) - 1 freq xvk (4) - 1 freq xv (4) - 6 freq xf (4) - 6 freq muve (4) - 20 freq mv (4) - 2 freq movd (4) - 1 freq mxjt (4) - 1 freq vevf (4) - 1 freq xvo (4) - 1 freq mxgg (4) - 1 freq mvd (4) - 1 freq xvi (4) - 3 freq mf (4) - 1 freq mov (4) - 3 freq xvq (4) - 1 freq mhvq (4) - 1 freq mgv (4) - 1 freq mef (4) - 2 freq |
SoundEx code - M210 macafee - 16 freq magpie - 15 freq make-up - 27 freq misobey - 1 freq massive - 83 freq mix-up - 3 freq mak-up - 5 freq mischief - 25 freq mahoosive - 2 freq masseev - 1 freq makeup - 12 freq missive - 3 freq mspp - 1 freq mccabe - 2 freq mcphee - 12 freq mcpee - 1 freq mishap - 3 freq mcguffie - 3 freq msp - 53 freq macphee - 3 freq mojave - 1 freq mesefu - 1 freq mgv - 1 freq mcchubb - 6 freq mizpah - 2 freq mischeef - 1 freq mischeive - 1 freq mcguff - 1 freq muscovy - 1 freq mikeyboy - 2 freq mcub - 1 freq mashup - 1 freq mgjpi - 1 freq msxv - 1 freq mxpie - 1 freq mgp - 1 freq mcf - 3 freq mcavoy - 2 freq mxvf - 1 freq mahoossive - 1 freq massiv - 1 freq mkip - 1 freq mixy-up - 1 freq mmhxf - 1 freq micp - 1 freq mzva - 1 freq mxgib - 1 freq mkjzgowb - 1 freq macp - 1 freq mekgb - 1 freq |
MetaPhone code - MKSFF mxvf - 1 freq |
MXVF |
| Time to execute Levenshtein function - 0.207435 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.350595 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.029836 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.038203 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.000878 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. |