Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
---|---|---|---|---|
advisor (0) - 10 freq advisory (1) - 1 freq adivisor (1) - 1 freq advisors (1) - 3 freq adwisory (2) - 14 freq advisers (2) - 2 freq advisin (2) - 3 freq visor (2) - 2 freq advise (2) - 17 freq advisorie (2) - 1 freq addison (2) - 31 freq advised (2) - 16 freq advises (2) - 2 freq adio (3) - 1 freq adamson (3) - 1 freq advice (3) - 137 freq adair (3) - 1 freq davison (3) - 1 freq adveisars (3) - 1 freq admir (3) - 1 freq advyse (3) - 1 freq alison (3) - 410 freq editor (3) - 70 freq admirer (3) - 4 freq vistor (3) - 1 freq |
advisor (0) - 10 freq adivisor (1) - 1 freq advisory (1) - 1 freq advisorie (2) - 1 freq advisors (2) - 3 freq advise (3) - 17 freq advises (3) - 2 freq advised (3) - 16 freq visor (3) - 2 freq adwisory (3) - 14 freq advisers (3) - 2 freq advisin (3) - 3 freq advyse (4) - 1 freq addison (4) - 31 freq advysed (4) - 1 freq davison (4) - 1 freq adveisars (4) - 1 freq desir (5) - 1 freq dyvor (5) - 1 freq devisin (5) - 7 freq devisit (5) - 4 freq danser (5) - 1 freq devise (5) - 2 freq divider (5) - 1 freq diver (5) - 5 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 - ATFSR advisorie - 1 freq advisor - 10 freq advisory - 1 freq adivisor - 1 freq |
ADVISOR |
Time to execute Levenshtein function - 0.367747 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.531847 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.061626 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.042853 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.000972 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. |