| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| accessible (0) - 15 freq inaccessible (2) - 1 freq accessin' (3) - 1 freq acceptable (3) - 24 freq acsesibl (3) - 1 freq inaccessibles (3) - 1 freq accessin (3) - 5 freq inveesible (4) - 9 freq reversible (4) - 1 freq accessories (4) - 1 freq necessitie (4) - 1 freq macnessie (4) - 1 freq accessory (4) - 2 freq accressin (4) - 1 freq sensible (4) - 33 freq feasible (4) - 2 freq impossible (4) - 51 freq empossible (4) - 1 freq ansible (4) - 2 freq accessors (4) - 1 freq veisible (4) - 1 freq acceese (4) - 2 freq access (4) - 74 freq possible (4) - 178 freq recessive (4) - 1 freq |
accessible (0) - 15 freq inaccessible (3) - 1 freq acsesibl (4) - 1 freq accessibility (5) - 3 freq accessin (5) - 5 freq inaccessibles (5) - 1 freq acceptable (5) - 24 freq accessin' (5) - 1 freq accessors (6) - 1 freq guessable (6) - 1 freq empossible (6) - 1 freq unpossible (6) - 4 freq impossible (6) - 51 freq possible (6) - 178 freq access (6) - 74 freq accessory (6) - 2 freq accessed (6) - 2 freq accessories (6) - 1 freq accusinly (6) - 1 freq inacsesibl (6) - 1 freq occassional (7) - 1 freq poassibly (7) - 1 freq accoontable (7) - 3 freq occassions (7) - 1 freq possieble (7) - 1 freq |
SoundEx code - A221 accessible - 15 freq accessibility - 3 freq askexperts - 1 freq acsesibl - 1 freq ajijwebqr - 1 freq asuocbxu - 1 freq awgiqvse - 1 freq akawakeford - 3 freq axschxob - 1 freq |
MetaPhone code - AKSSBL accessible - 15 freq acsesibl - 1 freq |
ACCESSIBLE |
| Time to execute Levenshtein function - 0.198260 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.380482 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.028004 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.037771 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.001068 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. |