Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
---|---|---|---|---|
accepte (0) - 1 freq accepts (1) - 6 freq accepted (1) - 25 freq accept (1) - 76 freq accepin (2) - 1 freq accep (2) - 12 freq accent (2) - 116 freq acceptid (2) - 1 freq accede (2) - 1 freq accents (2) - 29 freq acceptin (2) - 16 freq acceese (2) - 2 freq accepps (2) - 1 freq acceptit (2) - 46 freq accepp (2) - 3 freq acceps (2) - 1 freq accepit (2) - 2 freq €œcept (3) - 1 freq ascent (3) - 2 freq accosted (3) - 2 freq accepting (3) - 3 freq acute (3) - 1 freq accentor (3) - 1 freq acceppit (3) - 12 freq raclette (3) - 1 freq |
accepte (0) - 1 freq accept (1) - 76 freq accepit (2) - 2 freq accepted (2) - 25 freq accepts (2) - 6 freq acceptit (3) - 46 freq acceps (3) - 1 freq acceptin (3) - 16 freq accepp (3) - 3 freq acceptid (3) - 1 freq accep (3) - 12 freq accepin (3) - 1 freq accent (3) - 116 freq accurate (4) - 9 freq cept (4) - 25 freq eccent (4) - 4 freq except (4) - 148 freq acceppit (4) - 12 freq crept (4) - 33 freq accompt (4) - 2 freq 'cept (4) - 9 freq accents (4) - 29 freq accede (4) - 1 freq acceese (4) - 2 freq accepps (4) - 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 - AKSPT accept - 76 freq accepit - 2 freq accepte - 1 freq acceppit - 12 freq |
ACCEPTE |
Time to execute Levenshtein function - 0.212334 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.347055 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.027576 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.039020 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.001000 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. |