| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| empie (0) - 25 freq kempie (1) - 1 freq hempie (1) - 2 freq empied (1) - 3 freq emptie (1) - 1 freq empien (1) - 1 freq empire (1) - 82 freq mxpie (2) - 1 freq spie (2) - 3 freq tempin (2) - 4 freq empire' (2) - 1 freq elsie (2) - 62 freq sapie (2) - 1 freq eadie (2) - 1 freq eisie (2) - 2 freq envie (2) - 2 freq eme (2) - 1 freq campie (2) - 16 freq effie (2) - 11 freq mie (2) - 3 freq kempit (2) - 2 freq erie (2) - 1 freq heapie (2) - 1 freq tempit (2) - 11 freq impit (2) - 1 freq |
empie (0) - 25 freq empien (2) - 1 freq empy (2) - 6 freq emptie (2) - 1 freq empire (2) - 82 freq kempie (2) - 1 freq empied (2) - 3 freq hempie (2) - 2 freq kypie (3) - 1 freq mp (3) - 39 freq empty (3) - 207 freq pie (3) - 117 freq impit (3) - 1 freq imp (3) - 3 freq imrie (3) - 1 freq email (3) - 50 freq ample (3) - 9 freq humpie (3) - 1 freq emit (3) - 4 freq pumpie (3) - 2 freq copie (3) - 17 freq dumpie (3) - 1 freq emoe (3) - 1 freq moip (3) - 2 freq peopie (3) - 1 freq |
SoundEx code - E510 empie - 25 freq envy - 25 freq envie - 2 freq enuf - 13 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 - EMP empie - 25 freq empy - 6 freq |
EMPIE |
| Time to execute Levenshtein function - 0.194369 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.320580 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.027090 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.036734 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.000837 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. |