| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| evertype (0) - 2 freq ivertyme (2) - 1 freq everyone (3) - 96 freq ever've (3) - 1 freq everie (3) - 4 freq evermore (3) - 2 freq every- (3) - 1 freq overtone (3) - 1 freq everly (3) - 1 freq everthin (3) - 2 freq everee (3) - 1 freq everytime (3) - 10 freq every (3) - 822 freq everyane (3) - 1 freq everyeen (3) - 4 freq overtake (3) - 1 freq everywye (3) - 2 freq teletype (3) - 1 freq vertie (3) - 1 freq overtime (3) - 2 freq vertue (3) - 2 freq eventide (3) - 2 freq overty (3) - 1 freq everton (3) - 3 freq pertlie (4) - 1 freq |
evertype (0) - 2 freq ivertyme (3) - 1 freq vertie (4) - 1 freq overtake (4) - 1 freq vertue (4) - 2 freq overty (4) - 1 freq everton (4) - 3 freq overtime (4) - 2 freq everytime (4) - 10 freq overtone (4) - 1 freq avertin (5) - 1 freq vert (5) - 1 freq averts (5) - 1 freq overlap (5) - 1 freq veritie (5) - 3 freq vertew (5) - 1 freq vertigo (5) - 1 freq verity (5) - 2 freq overt (5) - 4 freq overtly (5) - 1 freq overtaik (5) - 1 freq avert (5) - 1 freq virtue (5) - 15 freq overtook (5) - 1 freq evermore (5) - 2 freq |
SoundEx code - E163 everything - 97 freq efforts - 50 freq everythin - 119 freq everythin's - 3 freq everytime - 10 freq effort - 105 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 - EFRTP evertype - 2 freq |
EVERTYPE |
| Time to execute Levenshtein function - 0.209675 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.408567 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.038796 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.041700 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.000908 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. |