| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| everyeen (0) - 4 freq everee (2) - 1 freq everyhin (2) - 30 freq everywan (2) - 13 freq eveneen (2) - 4 freq eberdeen (2) - 3 freq evergreen (2) - 5 freq eferneen (2) - 1 freq everyone (3) - 85 freq evergreens (3) - 1 freq everythin (3) - 113 freq everyfink (3) - 7 freq everybdy (3) - 6 freq berween (3) - 1 freq fermeen (3) - 1 freq evelynn (3) - 8 freq overseer (3) - 2 freq everycunt (3) - 18 freq everthin (3) - 2 freq gerdeen (3) - 10 freq iveree (3) - 7 freq eftrneen (3) - 1 freq everyane (3) - 1 freq ivergreen (3) - 1 freq kerryeen (3) - 1 freq |
everyeen (0) - 4 freq everyane (3) - 1 freq eveneen (3) - 4 freq everywan (3) - 13 freq everyhin (3) - 30 freq everyone (3) - 85 freq everee (3) - 1 freq everwan (4) - 2 freq everie (4) - 4 freq verneer (4) - 5 freq everson (4) - 3 freq overseein (4) - 1 freq every- (4) - 1 freq everton (4) - 3 freq every (4) - 799 freq everyday (4) - 32 freq evelyn (4) - 1 freq everywye (4) - 2 freq varyan (4) - 1 freq iverywan (4) - 1 freq oversee (4) - 1 freq evryhin (4) - 2 freq everyones (4) - 2 freq everhin (4) - 1 freq evrywan (4) - 1 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 - EFRYN everyone - 85 freq everyane - 1 freq everyeen - 4 freq |
EVERYEEN |
| Time to execute Levenshtein function - 0.198901 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.342366 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.027379 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.037845 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.000844 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. |