| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| everyday (0) - 32 freq everyday' (1) - 1 freq everday (1) - 2 freq iveryday (1) - 4 freq ivryday (2) - 5 freq everybdy (2) - 6 freq €œeveryday (2) - 2 freq everyboay (2) - 1 freq everywan (2) - 13 freq eeday (3) - 1 freq everubdy (3) - 1 freq everyhin (3) - 30 freq everwan (3) - 2 freq iverdey (3) - 1 freq everybudy (3) - 2 freq entryway (3) - 1 freq everywhar (3) - 1 freq everywye (3) - 2 freq seterday (3) - 10 freq iverywan (3) - 1 freq everyeen (3) - 4 freq varday (3) - 2 freq feyday (3) - 1 freq heyday (3) - 1 freq mersday (3) - 1 freq |
everyday (0) - 32 freq everday (1) - 2 freq iveryday (1) - 4 freq everyday' (2) - 1 freq ivryday (2) - 5 freq varday (3) - 2 freq iverdey (3) - 1 freq everyboay (3) - 1 freq everybdy (3) - 6 freq every (4) - 799 freq everybody (4) - 91 freq everyone (4) - 85 freq everyboady (4) - 24 freq everboady (4) - 2 freq everyane (4) - 1 freq verde (4) - 2 freq ivered (4) - 4 freq verdi (4) - 1 freq overdue (4) - 9 freq everly (4) - 1 freq verray (4) - 1 freq freyday (4) - 5 freq every- (4) - 1 freq overdo (4) - 1 freq everybudy (4) - 2 freq |
SoundEx code - E163 everything - 96 freq efforts - 50 freq everythin - 113 freq everythin's - 3 freq everytime - 10 freq effort - 99 freq everywhaut - 1 freq everyday - 32 freq everything's - 3 freq everday - 2 freq eupboards - 1 freq effert - 1 freq effirt - 3 freq everything'll - 1 freq effart - 1 freq everyday' - 1 freq ever-decreasing - 1 freq €œeveryday - 2 freq effortlessly - 4 freq everthin - 2 freq €œeverything - 2 freq everythin' - 1 freq €™everything - 1 freq eberdeen - 3 freq evertype - 2 freq everthings - 1 freq efforts' - 1 freq everythins - 3 freq everton - 3 freq everydaysaschoolday - 1 freq |
MetaPhone code - EFRT effort - 99 freq everyday - 32 freq everday - 2 freq effert - 1 freq effirt - 3 freq effart - 1 freq everyday' - 1 freq €œeveryday - 2 freq |
EVERYDAY |
| Time to execute Levenshtein function - 0.174774 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.356633 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.029723 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.047363 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.000816 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. |