Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
---|---|---|---|---|
acceptit (0) - 46 freq accepit (1) - 2 freq acceppit (1) - 12 freq acceptid (1) - 1 freq acceptin (1) - 16 freq accepin (2) - 1 freq exceptit (2) - 2 freq acceppin (2) - 3 freq accostit (2) - 4 freq accepted (2) - 23 freq accept (2) - 74 freq accepte (2) - 1 freq accepting (2) - 3 freq accepts (2) - 5 freq facetit (3) - 1 freq scriptit (3) - 1 freq actit (3) - 9 freq accents (3) - 25 freq attemptit (3) - 7 freq creatit (3) - 34 freq accursit (3) - 1 freq acquentit (3) - 2 freq accordit (3) - 4 freq cheptir (3) - 9 freq assertit (3) - 2 freq |
acceptit (0) - 46 freq acceptin (2) - 16 freq acceptid (2) - 1 freq acceppit (2) - 12 freq accepit (2) - 2 freq accept (3) - 74 freq accepts (3) - 5 freq accepted (3) - 23 freq accepte (3) - 1 freq accostit (3) - 4 freq exceptit (3) - 2 freq accountit (4) - 1 freq accepin (4) - 1 freq accepting (4) - 3 freq acceppin (4) - 3 freq accent (5) - 108 freq cheatit (5) - 3 freq acceps (5) - 1 freq clertit (5) - 1 freq scentit (5) - 2 freq adaptit (5) - 6 freq exceptin (5) - 6 freq accepp (5) - 3 freq competit (5) - 1 freq accreditit (5) - 1 freq |
SoundEx code - A213 accept - 74 freq acceptance - 30 freq accepts - 5 freq acceptin - 16 freq accepted - 23 freq acceptable - 24 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 - 23 freq acceptit - 46 freq acceptid - 1 freq |
ACCEPTIT |
Time to execute Levenshtein function - 0.201290 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.377116 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.028103 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.040228 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.001082 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. |