| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| evelynn (0) - 8 freq evelyn (1) - 1 freq eveluin (2) - 1 freq eelyin (2) - 1 freq evening (3) - 75 freq everyane (3) - 1 freq evenin' (3) - 1 freq everywan (3) - 13 freq develing (3) - 1 freq everson (3) - 3 freq evens (3) - 1 freq evenins (3) - 10 freq flynn (3) - 8 freq relyan (3) - 1 freq everhin (3) - 1 freq relyin (3) - 7 freq eveneen (3) - 4 freq everyone (3) - 85 freq erenn (3) - 1 freq eely (3) - 2 freq mcglynn (3) - 2 freq everton (3) - 3 freq explenn (3) - 11 freq everwan (3) - 2 freq every- (3) - 1 freq |
evelynn (0) - 8 freq evelyn (2) - 1 freq eveluin (3) - 1 freq eveneen (4) - 4 freq evolvin (4) - 1 freq evenan (4) - 2 freq evenin (4) - 133 freq flynn (4) - 8 freq lynn (4) - 1 freq eelyin (4) - 1 freq venn (4) - 1 freq evinin (5) - 1 freq revellin (5) - 3 freq levellin (5) - 5 freq velye (5) - 1 freq everyeen (5) - 4 freq alonn (5) - 1 freq evein (5) - 3 freq event (5) - 103 freq airlann (5) - 20 freq lynin (5) - 1 freq hlnn (5) - 1 freq ootlinn (5) - 3 freq linn (5) - 26 freq blinn (5) - 20 freq |
SoundEx code - E145 eyeballin - 5 freq eveluin - 1 freq effluent - 1 freq €˜eflin - 1 freq evelynn - 8 freq ebullient - 1 freq evelyn - 1 freq |
MetaPhone code - EFLN eveluin - 1 freq €˜eflin - 1 freq evelynn - 8 freq evelyn - 1 freq |
EVELYNN |
| Time to execute Levenshtein function - 0.302896 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.533871 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.061838 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.038709 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.000814 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. |