| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| advocates (0) - 6 freq advocate (1) - 7 freq advocated (1) - 1 freq advocat (2) - 2 freq advocatit (2) - 1 freq advocatin (2) - 1 freq molocates (3) - 2 freq associates (3) - 4 freq allocated (3) - 1 freq avocados (3) - 1 freq advocaat (3) - 2 freq advices (3) - 1 freq allocate (3) - 2 freq advocacy (3) - 4 freq doated (4) - 1 freq automated (4) - 5 freq descartes (4) - 3 freq debates (4) - 11 freq indicates (4) - 13 freq avochat (4) - 1 freq abdicate (4) - 1 freq atrocities (4) - 3 freq decades (4) - 47 freq avocado (4) - 2 freq accolytes (4) - 1 freq |
advocates (0) - 6 freq advocated (2) - 1 freq advocate (2) - 7 freq advocatin (3) - 1 freq advocat (3) - 2 freq advocatit (3) - 1 freq advocaat (4) - 2 freq advices (4) - 1 freq adverts (5) - 26 freq advocacy (5) - 4 freq associates (5) - 4 freq molocates (5) - 2 freq avocados (5) - 1 freq doocots (5) - 2 freq advuntages (6) - 1 freq addicted (6) - 10 freq advice (6) - 133 freq divots (6) - 5 freq idiocies (6) - 1 freq vacate (6) - 1 freq edkeates (6) - 3 freq drochts (6) - 1 freq educated (6) - 19 freq dotes (6) - 1 freq docaturs (6) - 1 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 - ATFKTS advocates - 6 freq |
ADVOCATES |
| Time to execute Levenshtein function - 0.190543 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.362517 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.027593 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.037921 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.000846 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. |