| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| acceptance (0) - 31 freq acceptable (2) - 24 freq acceptsna (3) - 1 freq acceptin (3) - 16 freq accordance (3) - 3 freq accepte (3) - 1 freq acquentance (3) - 1 freq accepting (3) - 3 freq assistance (4) - 10 freq acceppin (4) - 3 freq accepin (4) - 1 freq accepted (4) - 25 freq certane (4) - 2 freq cuttance (4) - 7 freq allegiance (4) - 7 freq accoontancy (4) - 3 freq receptacle (4) - 1 freq acceptit (4) - 46 freq chestane (4) - 1 freq abeyance (4) - 1 freq acceptid (4) - 1 freq repentance (4) - 3 freq accepts (4) - 6 freq accept (4) - 76 freq ascendancy (4) - 1 freq |
acceptance (0) - 31 freq acceptin (4) - 16 freq accepting (4) - 3 freq acceptable (4) - 24 freq acceptsna (5) - 1 freq accoontancy (5) - 3 freq acquentance (5) - 1 freq accordance (5) - 3 freq accepte (5) - 1 freq accidence (6) - 1 freq acceptid (6) - 1 freq acquantance (6) - 1 freq acceptit (6) - 46 freq chaptane (6) - 1 freq accept (6) - 76 freq accepts (6) - 6 freq cuttance (6) - 7 freq acceppin (6) - 3 freq competence (6) - 5 freq accepin (6) - 1 freq accepted (6) - 25 freq comeuppance (7) - 6 freq accountant (7) - 1 freq occurrence (7) - 3 freq accountan (7) - 1 freq |
SoundEx code - A213 accept - 76 freq acceptance - 31 freq accepts - 6 freq acceptin - 16 freq accepted - 25 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 - AKSPTNS acceptance - 31 freq |
ACCEPTANCE |
| Time to execute Levenshtein function - 0.220293 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.373996 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.027766 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.037443 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.000948 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. |