| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| acceppin (0) - 3 freq acceppit (1) - 12 freq acceptin (1) - 16 freq accepin (1) - 1 freq accepting (2) - 3 freq accepps (2) - 1 freq acceptit (2) - 46 freq exceppin (2) - 2 freq acceptid (2) - 1 freq accepp (2) - 3 freq accepit (2) - 2 freq accessin (2) - 5 freq appin (3) - 2 freq accessin' (3) - 1 freq accepted (3) - 25 freq chippin (3) - 7 freq preppin (3) - 1 freq chappin (3) - 69 freq cappin (3) - 1 freq heppin (3) - 1 freq occupyin (3) - 2 freq accordin (3) - 86 freq accressin (3) - 1 freq accusin (3) - 7 freq scrappin (3) - 5 freq |
acceppin (0) - 3 freq accepin (2) - 1 freq acceptin (2) - 16 freq acceppit (2) - 12 freq accepp (3) - 3 freq exceppin (3) - 2 freq accepps (3) - 1 freq crappin (4) - 11 freq clippin (4) - 12 freq occupyin (4) - 2 freq choppin (4) - 5 freq clappin (4) - 46 freq cappin (4) - 1 freq hiccuppin (4) - 1 freq cuppin (4) - 6 freq chappin (4) - 69 freq acceptid (4) - 1 freq acceptit (4) - 46 freq accepting (4) - 3 freq accessin (4) - 5 freq accepit (4) - 2 freq chippin (4) - 7 freq accepte (5) - 1 freq exceptin (5) - 6 freq steppin (5) - 41 freq |
SoundEx code - A215 achievement - 21 freq aspen - 10 freq achievements - 7 freq acheivement - 1 freq accepin - 1 freq a'ghobhainn - 1 freq achievin - 3 freq aik-panelled - 1 freq acceppin - 3 freq acupuncture - 1 freq azpnofbgol - 1 freq achieving - 1 freq |
MetaPhone code - AKSPN accepin - 1 freq acceppin - 3 freq |
ACCEPPIN |
| Time to execute Levenshtein function - 0.223494 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.414424 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.029962 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.044305 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.000963 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. |