| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| accepp (0) - 3 freq acceps (1) - 1 freq accep (1) - 12 freq accept (1) - 76 freq accepps (1) - 1 freq accepte (2) - 1 freq accepit (2) - 2 freq access (2) - 74 freq acceppin (2) - 3 freq accede (2) - 1 freq acceppit (2) - 12 freq accepin (2) - 1 freq accent (2) - 116 freq acce (2) - 1 freq accepts (2) - 6 freq cepp (2) - 1 freq ascent (3) - 2 freq ache (3) - 14 freq schep (3) - 2 freq ace's (3) - 1 freq acheen (3) - 1 freq apkeep (3) - 5 freq bicep (3) - 2 freq acer (3) - 1 freq attemp (3) - 5 freq |
accepp (0) - 3 freq accepps (2) - 1 freq accept (2) - 76 freq accep (2) - 12 freq acceps (2) - 1 freq accepin (3) - 1 freq cepp (3) - 1 freq acceppit (3) - 12 freq acceppin (3) - 3 freq accepit (3) - 2 freq accepte (3) - 1 freq fycpp (4) - 1 freq cleppy (4) - 1 freq cclop (4) - 1 freq clapp (4) - 1 freq occupy (4) - 7 freq ccp (4) - 3 freq copp (4) - 1 freq accent (4) - 116 freq acce (4) - 1 freq accepts (4) - 6 freq accede (4) - 1 freq access (4) - 74 freq creep (5) - 31 freq crepe (5) - 1 freq |
SoundEx code - A210 agape - 2 freq aesop - 8 freq achieve - 35 freq aseef - 1 freq accep - 12 freq asbo - 1 freq agivey - 2 freq asap - 10 freq accepp - 3 freq ashby - 1 freq ausbau - 1 freq acuv - 1 freq aygxb - 1 freq agv - 1 freq agjjp - 1 freq aqp - 1 freq askjeff - 1 freq agp - 1 freq azv - 1 freq ayqv - 1 freq auxzv - 1 freq |
MetaPhone code - AKSP accep - 12 freq accepp - 3 freq |
ACCEPP |
| Time to execute Levenshtein function - 0.354274 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.519831 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.029819 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.078803 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.000887 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. |