| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| e-e-evenin (0) - 9 freq e-e-evenan (1) - 2 freq e---e-evenan (3) - 1 freq deepenin (4) - 3 freq steivenin (4) - 1 freq deefenin (4) - 2 freq reedenin (4) - 4 freq eleevin (4) - 4 freq deleeverin (4) - 1 freq 'evenin (4) - 1 freq evenin (4) - 133 freq eleeven (4) - 35 freq re-exeminin (4) - 1 freq i'evenin (4) - 2 freq eleevent (4) - 1 freq seekenin (4) - 1 freq expleinin (5) - 1 freq eleevinth (5) - 1 freq re-leevin (5) - 1 freq jleevin (5) - 1 freq hearkenin (5) - 2 freq deceivenie (5) - 2 freq hertenin (5) - 8 freq redeemin (5) - 1 freq deleiverin (5) - 1 freq |
e-e-evenin (0) - 9 freq e-e-evenan (1) - 2 freq e---e-evenan (5) - 1 freq evenin (6) - 133 freq i'evenin (6) - 2 freq steivenin (6) - 1 freq 'evenin (6) - 1 freq eleevent (7) - 1 freq seekenin (7) - 1 freq eveneen (7) - 4 freq aye-votin (7) - 1 freq evenan (7) - 2 freq evinin (7) - 1 freq ravenin (7) - 1 freq eleevin (7) - 4 freq deleeverin (7) - 1 freq reedenin (7) - 4 freq re-exeminin (7) - 1 freq deefenin (7) - 2 freq eleeven (7) - 35 freq deepenin (7) - 3 freq ee-opener (8) - 1 freq efternin (8) - 12 freq elefven (8) - 1 freq leistenin (8) - 1 freq |
SoundEx code - E155 evenin - 133 freq e-e-evenin - 9 freq evening - 75 freq effeminate - 1 freq evenins - 10 freq 'evenin - 1 freq evenin' - 1 freq evenins' - 2 freq eveneen - 4 freq evinin - 1 freq evenan - 2 freq e---e-evenan - 1 freq e-e-evenan - 2 freq eponymous - 4 freq evenin's - 1 freq evenings - 1 freq evenhaundit - 1 freq eveningexpress - 13 freq effanning - 1 freq |
MetaPhone code - EFNN evenin - 133 freq e-e-evenin - 9 freq 'evenin - 1 freq evenin' - 1 freq eveneen - 4 freq evinin - 1 freq evenan - 2 freq e---e-evenan - 1 freq e-e-evenan - 2 freq |
E-E-EVENIN |
| Time to execute Levenshtein function - 0.326244 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.786388 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.076023 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.092229 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.000864 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. |