| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| acceptability (0) - 1 freq acceptabilty (1) - 1 freq accountability (3) - 1 freq accessibility (3) - 3 freq accoontability (3) - 4 freq acceptable (4) - 25 freq adaptabeility (4) - 1 freq capability (4) - 1 freq inevitability (5) - 2 freq respectability (5) - 3 freq stability (5) - 3 freq aplicability (5) - 1 freq readability (5) - 1 freq credibility (5) - 3 freq acceptit (5) - 46 freq metaility (5) - 1 freq availability (5) - 5 freq adaptabilitee (5) - 1 freq notability (5) - 1 freq liability (6) - 5 freq versatility (6) - 2 freq ability (6) - 44 freq affabeility (6) - 1 freq disability (6) - 5 freq probability (6) - 2 freq |
acceptability (0) - 1 freq acceptabilty (1) - 1 freq accoontability (4) - 4 freq accountability (4) - 1 freq acceptable (5) - 25 freq accessibility (5) - 3 freq adaptabeility (6) - 1 freq capability (6) - 1 freq acceptit (7) - 46 freq adaptabilitee (7) - 1 freq unacceptable (8) - 1 freq notability (8) - 1 freq credibility (8) - 3 freq respectability (8) - 3 freq stability (8) - 3 freq inevitability (8) - 2 freq acceptid (9) - 1 freq accoontable (9) - 3 freq actuality (9) - 3 freq accepit (9) - 2 freq stabeility (9) - 1 freq accountable (9) - 3 freq accountable' (9) - 1 freq centrality (9) - 2 freq acceptance (9) - 31 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 - AKSPTBLT acceptabilty - 1 freq acceptability - 1 freq |
ACCEPTABILITY |
| Time to execute Levenshtein function - 0.223622 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.370752 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.027229 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.037018 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.000881 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. |