| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| advisable (0) - 4 freq visable (2) - 1 freq advisable-' (2) - 4 freq disable (2) - 1 freq unvisible (3) - 1 freq available (3) - 128 freq amiable (3) - 1 freq disabled (3) - 7 freq amicable (3) - 2 freq advise (3) - 17 freq adaptable (3) - 1 freq abailable (3) - 1 freq adappable (3) - 1 freq visible (3) - 25 freq unviable (3) - 1 freq enviable (3) - 1 freq yaisable (3) - 1 freq advisorie (3) - 1 freq invisible (3) - 44 freq viable (3) - 11 freq adorable (3) - 8 freq advice (4) - 137 freq advises (4) - 2 freq attainable (4) - 2 freq admirals (4) - 2 freq |
advisable (0) - 4 freq disable (3) - 1 freq visable (3) - 1 freq visible (4) - 25 freq unvisible (4) - 1 freq advisable-' (4) - 4 freq invisible (4) - 44 freq advisorie (5) - 1 freq enviable (5) - 1 freq visibly (5) - 9 freq veisible (5) - 1 freq unviable (5) - 1 freq adorable (5) - 8 freq viable (5) - 11 freq yaisable (5) - 1 freq available (5) - 128 freq adappable (5) - 1 freq disabled (5) - 7 freq advise (5) - 17 freq adaptable (5) - 1 freq dibble (6) - 1 freq realisable (6) - 1 freq vocable (6) - 1 freq faisible (6) - 3 freq dribble (6) - 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.294516 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.606981 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.028456 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.070661 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.000933 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. |