| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| adversity (0) - 7 freq adversary (2) - 1 freq versity (2) - 11 freq diversity (2) - 73 freq versify (3) - 1 freq adverse (3) - 1 freq adverts (3) - 27 freq aversion (3) - 4 freq density (3) - 4 freq ramversit (3) - 1 freq advert (3) - 32 freq aduersitie (3) - 1 freq university (3) - 130 freq diversity' (3) - 1 freq malversit (3) - 1 freq 'varsity (3) - 1 freq i'varsity (3) - 2 freq verity (3) - 2 freq severity (3) - 4 freq advertise (3) - 1 freq diversify (3) - 3 freq varsity (3) - 9 freq adverbial (3) - 1 freq veracity (4) - 2 freq adversaries (4) - 1 freq |
adversity (0) - 7 freq diversity (2) - 73 freq versity (3) - 11 freq adversary (3) - 1 freq university (4) - 130 freq aduersitie (4) - 1 freq diversitee (4) - 1 freq 'varsity (4) - 1 freq advert (4) - 32 freq diversity' (4) - 1 freq diversitie (4) - 1 freq adverse (4) - 1 freq diversify (4) - 3 freq i'varsity (4) - 2 freq varsity (4) - 9 freq doverit (5) - 1 freq diversion (5) - 4 freq divertit (5) - 3 freq adverteisit (5) - 1 freq biodiversity (5) - 1 freq adverbial (5) - 1 freq density (5) - 4 freq advertise (5) - 1 freq adverts (5) - 27 freq versify (5) - 1 freq |
SoundEx code - A316 advertised - 8 freq adverts - 27 freq adversity - 7 freq advert - 32 freq advertisin - 8 freq advertising - 6 freq advertisment - 1 freq advertisement - 2 freq advertise - 1 freq adverbs - 13 freq adverb - 3 freq adverteise - 1 freq advertiseens - 1 freq adverteisements - 1 freq advertiser - 1 freq adverteisit - 1 freq adverteesin - 4 freq awdevorin - 1 freq advertisers - 2 freq advertisements - 1 freq adversaries - 1 freq adverbially - 1 freq aydbr - 1 freq atforsyth - 1 freq adversary - 1 freq adverbial - 1 freq adverse - 1 freq |
MetaPhone code - ATFRST adversity - 7 freq |
ADVERSITY |
| Time to execute Levenshtein function - 0.303723 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.483618 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.027692 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.038935 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.000924 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. |