| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| accepin (0) - 1 freq acceppin (1) - 3 freq accepit (1) - 2 freq acceptin (1) - 16 freq accusin (2) - 7 freq accepts (2) - 6 freq acceppit (2) - 12 freq accepte (2) - 1 freq acceptid (2) - 1 freq acceps (2) - 1 freq saucepin (2) - 1 freq acceptit (2) - 46 freq accepp (2) - 3 freq accep (2) - 12 freq accessin (2) - 5 freq accepps (2) - 1 freq accepting (2) - 3 freq accept (2) - 76 freq aetin (3) - 27 freq ahein (3) - 1 freq annexin (3) - 1 freq athein (3) - 1 freq accessin' (3) - 1 freq peepin (3) - 6 freq escapin (3) - 13 freq |
accepin (0) - 1 freq acceptin (2) - 16 freq accepit (2) - 2 freq acceppin (2) - 3 freq saucepin (3) - 1 freq accepp (3) - 3 freq accept (3) - 76 freq acceps (3) - 1 freq occupyin (3) - 2 freq accep (3) - 12 freq accusin (3) - 7 freq accepte (3) - 1 freq coupin (4) - 7 freq saucepan (4) - 4 freq hiccupin (4) - 1 freq cowpin (4) - 26 freq copin (4) - 4 freq coopin (4) - 1 freq cappin (4) - 1 freq carpin (4) - 2 freq clipin (4) - 1 freq clypin (4) - 8 freq cheepin (4) - 6 freq scoopin (4) - 7 freq cuppin (4) - 6 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 |
ACCEPIN |
| Time to execute Levenshtein function - 0.221723 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.366722 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.027150 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.038788 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.000891 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. |