| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| effernneen (0) - 1 freq efterneen (2) - 69 freq eferneen (2) - 1 freq afterneen (3) - 6 freq efterneens (3) - 1 freq eftrneen (3) - 1 freq aifterneen (4) - 26 freq efternune (4) - 4 freq efternuin (4) - 60 freq efterninn (4) - 2 freq eveneen (4) - 4 freq enterteen (4) - 3 freq efternunes (4) - 1 freq efternoon (4) - 57 freq efternane (4) - 3 freq eberdeen (4) - 3 freq efternin (4) - 11 freq everyeen (4) - 4 freq evergreen (4) - 5 freq foreneen (4) - 39 freq efternain (4) - 1 freq eftirneun (4) - 1 freq eftemeen (4) - 1 freq efternön (4) - 2 freq fermeen (4) - 1 freq |
effernneen (0) - 1 freq eferneen (4) - 1 freq efterneen (4) - 69 freq eftrneen (5) - 1 freq efterneens (5) - 1 freq afterneen (5) - 6 freq efterninn (5) - 2 freq foreneen (6) - 39 freq efternin (6) - 11 freq affrontin (6) - 2 freq efternane (6) - 3 freq eftirneun (6) - 1 freq efternain (6) - 1 freq efternoon (6) - 57 freq aifterneen (6) - 26 freq efternune (6) - 4 freq efternuin (6) - 60 freq efternunes (6) - 1 freq eftirnuin (7) - 2 freq offern (7) - 1 freq afternoon (7) - 103 freq offerin (7) - 64 freq rennen (7) - 2 freq offerings (7) - 3 freq efternoons (7) - 9 freq |
SoundEx code - E165 everyhin - 30 freq everyhin's - 4 freq everyhing - 14 freq everywan - 13 freq everywan's - 4 freq everyone - 85 freq everywans - 1 freq evermair - 5 freq everyhing's - 1 freq everynight - 1 freq everyone's - 2 freq evriwan - 2 freq evriman - 1 freq evermore - 2 freq everyane - 1 freq effeirin - 31 freq everyeen - 4 freq everywhan - 1 freq evrihin - 1 freq evryhin - 2 freq evrywan - 1 freq everwan - 2 freq every'hin' - 1 freq ever-more - 1 freq everhin - 1 freq eferneen - 1 freq effernneen - 1 freq everywoman - 2 freq eparnpr - 1 freq everyones - 2 freq evryhing - 1 freq |
MetaPhone code - EFRNN eferneen - 1 freq effernneen - 1 freq |
EFFERNNEEN |
| Time to execute Levenshtein function - 0.208216 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.350213 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.027510 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.037383 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.000820 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. |