| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| autocorrect (0) - 7 freq autocorrectÂ’s (3) - 1 freq 'correct (4) - 1 freq autosort (4) - 1 freq incorrect (4) - 1 freq autocrat (4) - 4 freq correct (4) - 40 freq €˜correct (4) - 1 freq atoore (5) - 3 freq autoricht (5) - 1 freq upforret (5) - 1 freq autonomist (5) - 3 freq corrects (5) - 1 freq autocue (5) - 1 freq correck (5) - 3 freq torrent (5) - 4 freq aulfarrent (5) - 1 freq authort (5) - 2 freq coreect (5) - 1 freq hypercorrect (5) - 1 freq abhorrent (5) - 2 freq autocar (5) - 1 freq authourt (5) - 2 freq faur-forrit (6) - 1 freq cornert (6) - 1 freq |
autocorrect (0) - 7 freq incorrect (5) - 1 freq correct (5) - 40 freq 'correct (5) - 1 freq autocorrectÂ’s (6) - 1 freq €˜correct (6) - 1 freq autocrat (6) - 4 freq torrent (7) - 4 freq correck (7) - 3 freq coreect (7) - 1 freq autosort (7) - 1 freq corrects (7) - 1 freq corrupt (8) - 13 freq correctin (8) - 6 freq correctit (8) - 4 freq 'corrupt (8) - 1 freq conract (8) - 1 freq correctet (8) - 2 freq attract (8) - 7 freq correckit (8) - 2 freq carret (8) - 3 freq correctly (8) - 6 freq recurrent (8) - 2 freq resurrect (8) - 3 freq abhorrent (8) - 2 freq |
SoundEx code - A326 adjourn - 3 freq adjourns - 2 freq autographed - 2 freq aithsworn - 4 freq autocar - 1 freq attackers - 1 freq autographs - 2 freq autograph - 1 freq adwisory - 14 freq autocrat - 4 freq autosort - 1 freq autocorrect - 7 freq autocorrectÂ’s - 1 freq adcramps - 1 freq aetshirts - 2 freq aetgraphics - 1 freq |
MetaPhone code - ATKRKT autocorrect - 7 freq |
AUTOCORRECT |
| Time to execute Levenshtein function - 0.218749 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.460167 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.060577 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.037173 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.001144 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. |