| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| eminem (0) - 2 freq eines (2) - 3 freq einer (2) - 1 freq mine' (2) - 2 freq exminer (2) - 1 freq minen (2) - 1 freq mined (2) - 5 freq mine (2) - 660 freq mines (2) - 66 freq einen (2) - 1 freq ermine (2) - 7 freq miner (2) - 7 freq 'mines (2) - 1 freq 'mine' (2) - 2 freq remine (2) - 2 freq emblem (2) - 4 freq minet (2) - 2 freq eine (2) - 1 freq erinm (2) - 2 freq enem (2) - 2 freq devine (3) - 3 freq 'mint (3) - 1 freq remaned (3) - 1 freq editer (3) - 1 freq reeined (3) - 1 freq |
eminem (0) - 2 freq mines (3) - 66 freq minet (3) - 2 freq enem (3) - 2 freq mine (3) - 660 freq erinm (3) - 2 freq miner (3) - 7 freq mine' (3) - 2 freq minen (3) - 1 freq mined (3) - 5 freq monen (4) - 1 freq amin (4) - 1 freq minus (4) - 5 freq minit (4) - 20 freq nem (4) - 53 freq minto (4) - 5 freq miny (4) - 1 freq munes (4) - 4 freq minne (4) - 3 freq mint (4) - 64 freq mynes (4) - 4 freq emanuel (4) - 1 freq mine-a (4) - 2 freq minor (4) - 15 freq mim (4) - 4 freq |
SoundEx code - E555 eminently - 2 freq eminem - 2 freq eminence - 1 freq eamonnoneill - 3 freq |
MetaPhone code - EMNM eminem - 2 freq |
EMINEM |
| Time to execute Levenshtein function - 0.449183 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.993432 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.080075 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.092765 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.000948 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. |