Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
---|---|---|---|---|
advocat (0) - 2 freq advocaat (1) - 2 freq advocate (1) - 7 freq advocatit (2) - 1 freq advocatin (2) - 1 freq advocacy (2) - 4 freq advocates (2) - 6 freq avochat (2) - 1 freq advocated (2) - 1 freq advert (3) - 32 freq acrobat (3) - 3 freq allocate (3) - 2 freq aduncan (3) - 42 freq afloat (3) - 12 freq adroit (3) - 2 freq adopt (3) - 11 freq doat (3) - 1 freq advancit (3) - 1 freq aloat (3) - 8 freq voat (3) - 1 freq aocau (3) - 1 freq addict (3) - 1 freq avocado (3) - 2 freq adornt (3) - 1 freq docht (3) - 4 freq |
advocat (0) - 2 freq advocate (1) - 7 freq advocaat (1) - 2 freq advocated (3) - 1 freq advocacy (3) - 4 freq advocates (3) - 6 freq advocatin (3) - 1 freq advocatit (3) - 1 freq advice (4) - 133 freq advancit (4) - 1 freq dovecot (4) - 4 freq advent (4) - 8 freq addict (4) - 1 freq advices (4) - 1 freq avochat (4) - 1 freq advert (4) - 32 freq doocot (4) - 28 freq educate (5) - 15 freq doocoot (5) - 1 freq decait (5) - 2 freq edict (5) - 2 freq doo-cot (5) - 1 freq divot (5) - 13 freq vacate (5) - 1 freq evict (5) - 2 freq |
SoundEx code - A312 advisorie - 1 freq advice - 133 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 |
ADVOCAT |
Time to execute Levenshtein function - 0.232940 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.370703 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.027390 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.037234 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.000804 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. |