| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| acceptit (0) - 46 freq acceppit (1) - 12 freq acceptid (1) - 1 freq accepit (1) - 2 freq acceptin (1) - 16 freq accepting (2) - 3 freq accepte (2) - 1 freq accept (2) - 76 freq accepin (2) - 1 freq accepts (2) - 6 freq accepted (2) - 25 freq acceppin (2) - 3 freq exceptit (2) - 2 freq accostit (2) - 4 freq alertit (3) - 2 freq accordit (3) - 4 freq accents' (3) - 2 freq attemptit (3) - 7 freq accountit (3) - 1 freq cheptir (3) - 9 freq actit (3) - 9 freq exceptin (3) - 6 freq adoptit (3) - 14 freq accreditit (3) - 1 freq accent (3) - 116 freq |
acceptit (0) - 46 freq acceptin (2) - 16 freq accepit (2) - 2 freq acceptid (2) - 1 freq acceppit (2) - 12 freq accepts (3) - 6 freq accepted (3) - 25 freq exceptit (3) - 2 freq accostit (3) - 4 freq accepte (3) - 1 freq accept (3) - 76 freq accountit (4) - 1 freq acceppin (4) - 3 freq accepin (4) - 1 freq accepting (4) - 3 freq clertit (5) - 1 freq accep (5) - 12 freq facetit (5) - 1 freq acquentit (5) - 2 freq accentor (5) - 1 freq creatit (5) - 34 freq acceps (5) - 1 freq accursit (5) - 1 freq computit (5) - 2 freq acceptsna (5) - 1 freq |
SoundEx code - A213 accept - 76 freq acceptance - 31 freq accepts - 6 freq acceptin - 16 freq accepted - 25 freq acceptable - 25 freq accepit - 2 freq acceptit - 46 freq acceptabilty - 1 freq accepting - 3 freq achieved - 14 freq aspidistra - 1 freq asphodel - 1 freq accepte - 1 freq acceppit - 12 freq acceptilautioun - 1 freq aquavit - 1 freq acceptability - 1 freq acceptid - 1 freq acceptsna - 1 freq ajfter - 1 freq assipattle - 5 freq assipattle's - 1 freq aspd - 1 freq agiftaday - 4 freq aqua-fit - 1 freq aqbudsuu - 1 freq |
MetaPhone code - AKSPTT accepted - 25 freq acceptit - 46 freq acceptid - 1 freq |
ACCEPTIT |
| Time to execute Levenshtein function - 0.505769 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.893143 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.174395 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.108928 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.000910 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. |