Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
---|---|---|---|---|
emva (0) - 1 freq eva (1) - 7 freq eeva (1) - 1 freq emma (1) - 42 freq alva (2) - 2 freq ena (2) - 16 freq evz (2) - 1 freq mzva (2) - 1 freq nova (2) - 7 freq ems (2) - 4 freq emfj (2) - 1 freq 'ma (2) - 79 freq era (2) - 30 freq rova (2) - 1 freq embra (2) - 96 freq smaa (2) - 123 freq cva (2) - 1 freq maa (2) - 16 freq xmvp (2) - 1 freq a'va (2) - 1 freq emz (2) - 4 freq tmv (2) - 1 freq avva (2) - 1 freq rva (2) - 1 freq envy (2) - 25 freq |
emva (0) - 1 freq eva (2) - 7 freq mv (2) - 2 freq emma (2) - 42 freq mve (2) - 1 freq eeva (2) - 1 freq emit (3) - 4 freq cava (3) - 1 freq imna (3) - 1 freq muve (3) - 20 freq ervo (3) - 2 freq mma (3) - 3 freq imma (3) - 1 freq amna (3) - 15 freq emaaq (3) - 1 freq iva (3) - 1 freq emm (3) - 6 freq ima (3) - 1 freq emo (3) - 6 freq eve (3) - 80 freq mave (3) - 1 freq va (3) - 5 freq ma (3) - 15179 freq mvk (3) - 1 freq viva (3) - 6 freq |
SoundEx code - E510 empie - 25 freq envy - 25 freq envie - 2 freq enuf - 13 freq enu'f - 1 freq empy - 6 freq eneuf - 1 freq enuff - 12 freq emva - 1 freq enof - 5 freq env - 1 freq emyf - 1 freq eiemv - 1 freq enoff - 1 freq |
MetaPhone code - EMF emva - 1 freq emyf - 1 freq eiemv - 1 freq |
EMVA |
Time to execute Levenshtein function - 0.204820 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.317435 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.028825 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.037653 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.000940 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. |