| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| everytime (0) - 10 freq overtime (2) - 2 freq efter-time (3) - 3 freq ower-time (3) - 1 freq eventimes (3) - 1 freq everyfink (3) - 7 freq owertime (3) - 1 freq everythin' (3) - 1 freq oertime (3) - 2 freq meytime (3) - 1 freq everyone (3) - 85 freq vertie (3) - 1 freq eventide (3) - 2 freq everyane (3) - 1 freq ivertyme (3) - 1 freq evertype (3) - 2 freq everyhing (3) - 14 freq everie (3) - 4 freq everythin (3) - 113 freq everyhin (3) - 30 freq veritie (3) - 3 freq everythins (3) - 3 freq everything (3) - 96 freq storytime (3) - 1 freq everywye (3) - 2 freq |
everytime (0) - 10 freq overtime (2) - 2 freq ivertyme (3) - 1 freq evertype (4) - 2 freq veritie (4) - 3 freq oertime (4) - 2 freq vertie (4) - 1 freq owertime (4) - 1 freq veectim (5) - 3 freq maritime (5) - 3 freq wartime (5) - 7 freq everton (5) - 3 freq vertue (5) - 2 freq overcome (5) - 2 freq airtime (5) - 1 freq overcame (5) - 2 freq overtone (5) - 1 freq mairtime (5) - 1 freq avertin (5) - 1 freq veictim (5) - 1 freq owertim (5) - 1 freq vertigo (5) - 1 freq waretime (5) - 1 freq verbatim (5) - 3 freq overtake (5) - 1 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 - EFRTM everytime - 10 freq |
EVERYTIME |
| Time to execute Levenshtein function - 0.198941 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.354383 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.030507 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.039906 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.000786 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. |