| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| everthin (0) - 2 freq everyhin (1) - 30 freq everythin (1) - 113 freq everhin (1) - 1 freq avertin (2) - 1 freq exertin (2) - 1 freq evryhin (2) - 2 freq everton (2) - 3 freq everythin' (2) - 1 freq everyhing (2) - 14 freq everythins (2) - 3 freq iverythin (2) - 14 freq everything (2) - 96 freq revertin (2) - 2 freq everthings (2) - 1 freq evrihin (2) - 1 freq iverthing (2) - 1 freq omethin (3) - 1 freq mertin (3) - 2 freq ivrythin (3) - 3 freq hertnin (3) - 5 freq leverin (3) - 2 freq eethir (3) - 10 freq seithin (3) - 1 freq eveluin (3) - 1 freq |
everthin (0) - 2 freq everythin (1) - 113 freq iverythin (2) - 14 freq everhin (2) - 1 freq everyhin (2) - 30 freq vrythin (3) - 1 freq iveriethin (3) - 13 freq evrihin (3) - 1 freq ivirythin (3) - 2 freq ivrythin (3) - 3 freq everything (3) - 96 freq iverthing (3) - 1 freq everythins (3) - 3 freq ivirithin (3) - 1 freq avertin (3) - 1 freq everton (3) - 3 freq evryhin (3) - 2 freq everythin' (3) - 1 freq ivriethin (4) - 3 freq birthin (4) - 6 freq ivvrythin (4) - 1 freq ivverythin (4) - 3 freq overturn (4) - 1 freq everywhan (4) - 1 freq freithin (4) - 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 - EFR0N everythin - 113 freq everthin - 2 freq everythin' - 1 freq |
EVERTHIN |
| Time to execute Levenshtein function - 0.225219 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.445955 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.028306 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.037495 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.000794 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. |