| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| advisable (1) - 4 freq advisable-' (1) - 4 freq disable (3) - 1 freq disabled (3) - 7 freq visable (3) - 1 freq enviable (4) - 1 freq amicable (4) - 2 freq unvisible (4) - 1 freq unviable (4) - 1 freq adorable (4) - 8 freq adappable (4) - 1 freq amiable (4) - 1 freq advise (4) - 17 freq abailable (4) - 1 freq yaisable (4) - 1 freq viable (4) - 11 freq invisible (4) - 44 freq available (4) - 128 freq disablit (4) - 1 freq adaptable (4) - 1 freq visible (4) - 25 freq advisorie (4) - 1 freq advises (4) - 2 freq advised (4) - 16 freq habitable (5) - 4 freq |
advisable (2) - 4 freq advisable-' (2) - 4 freq visable (5) - 1 freq disabled (5) - 7 freq disable (5) - 1 freq disablit (6) - 1 freq visible (6) - 25 freq unvisible (6) - 1 freq invisible (6) - 44 freq visibly (7) - 9 freq available (7) - 128 freq adaptable (7) - 1 freq advised (7) - 16 freq advisorie (7) - 1 freq advises (7) - 2 freq veisible (7) - 1 freq unviable (7) - 1 freq viable (7) - 11 freq adappable (7) - 1 freq adorable (7) - 8 freq enviable (7) - 1 freq yaisable (7) - 1 freq advise (7) - 17 freq dibbled (8) - 1 freq faisible (8) - 3 freq |
SoundEx code - A312 advisorie - 1 freq advice - 137 freq advisable-' - 4 freq advisable - 4 freq advisor - 10 freq advise - 17 freq advocaat - 2 freq advised - 16 freq advocate - 7 freq advocates - 6 freq autobiography - 2 freq advisors - 3 freq advisin - 3 freq advice-' - 1 freq advocated - 1 freq atavistic - 1 freq advises - 2 freq autopsy - 2 freq adveisars - 1 freq advocacy - 4 freq advisers - 2 freq advocat - 2 freq atavism - 1 freq advysed - 1 freq advyse - 1 freq at-best - 1 freq advices - 1 freq advocatin - 1 freq advisory - 1 freq adivisor - 1 freq advocatit - 1 freq aotbpbqqw - 1 freq aodhbc - 4 freq atfc - 3 freq |
MetaPhone code - ATFSBL advisable-' - 4 freq advisable - 4 freq |
ADVISABLE- |
| Time to execute Levenshtein function - 0.388790 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.999862 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.079107 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.090651 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.000864 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. |