| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| advertising (0) - 6 freq advertisin (1) - 8 freq advertiser (3) - 1 freq advertised (3) - 8 freq advertiseens (3) - 1 freq advertisment (3) - 1 freq appetising (3) - 1 freq advertisers (3) - 2 freq advertise (3) - 1 freq adverteesin (3) - 4 freq adverteisit (3) - 1 freq adversity (4) - 7 freq asserting (4) - 1 freq adverts (4) - 26 freq addressing (4) - 2 freq avertin (4) - 1 freq despising (4) - 1 freq advertisement (4) - 2 freq appraising (4) - 1 freq excercising (4) - 1 freq diverting (4) - 1 freq adverteise (4) - 1 freq reverting (4) - 1 freq exercising (4) - 2 freq iverthing (4) - 1 freq |
advertising (0) - 6 freq advertisin (2) - 8 freq advertiseens (4) - 1 freq adverteesin (4) - 4 freq diverting (5) - 1 freq adverteisit (5) - 1 freq advertised (5) - 8 freq advertise (5) - 1 freq advertiser (5) - 1 freq advertisers (5) - 2 freq advertisment (5) - 1 freq adverteise (6) - 1 freq advertisement (6) - 2 freq reverting (6) - 1 freq iverthing (6) - 1 freq addressing (6) - 2 freq appetising (6) - 1 freq derting (6) - 1 freq adverts (6) - 26 freq everything (7) - 97 freq iverything (7) - 1 freq divertin (7) - 6 freq depressing (7) - 3 freq darting (7) - 1 freq dressing (7) - 2 freq |
SoundEx code - A316 advertised - 8 freq adverts - 26 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 - ATFRTSNK advertising - 6 freq |
ADVERTISING |
| Time to execute Levenshtein function - 0.216951 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.410288 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.029453 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.038271 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.001000 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. |