Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
---|---|---|---|---|
advocate (0) - 7 freq advocated (1) - 1 freq advocat (1) - 2 freq advocates (1) - 6 freq advocatin (2) - 1 freq allocate (2) - 2 freq advocaat (2) - 2 freq advocacy (2) - 4 freq advocatit (2) - 1 freq advice (3) - 137 freq locate (3) - 2 freq avochat (3) - 1 freq allocated (3) - 1 freq educate (3) - 15 freq avocado (3) - 2 freq donate (3) - 9 freq relocate (3) - 2 freq abdicate (3) - 1 freq associate (3) - 15 freq adequate (3) - 4 freq vacate (3) - 1 freq favorite (4) - 2 freq accolade (4) - 1 freq adopts (4) - 1 freq autocue (4) - 1 freq |
advocate (0) - 7 freq advocat (1) - 2 freq advocated (2) - 1 freq advocates (2) - 6 freq advocaat (2) - 2 freq advocatit (3) - 1 freq advocacy (3) - 4 freq advocatin (3) - 1 freq educate (4) - 15 freq vacate (4) - 1 freq allocate (4) - 2 freq advice (4) - 137 freq addict (5) - 1 freq advices (5) - 1 freq advent (5) - 8 freq delicate (5) - 21 freq dedicate (5) - 8 freq advert (5) - 32 freq dovecot (5) - 4 freq doocot (5) - 28 freq advancit (5) - 1 freq evacuate (5) - 1 freq donate (5) - 9 freq abdicate (5) - 1 freq avocado (5) - 2 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 - ATFKT advocaat - 2 freq advocate - 7 freq advocat - 2 freq |
ADVOCATE |
Time to execute Levenshtein function - 0.188167 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.383937 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.027800 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.039559 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.000887 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. |