| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| advertisin (0) - 8 freq advertising (1) - 6 freq adverteisit (2) - 1 freq advertise (2) - 1 freq advertiser (2) - 1 freq advertised (2) - 8 freq adverteesin (2) - 4 freq advertisment (3) - 1 freq adverteise (3) - 1 freq advisin (3) - 3 freq advertiseens (3) - 1 freq adverts (3) - 27 freq advertisers (3) - 2 freq avertin (3) - 1 freq aversion (4) - 4 freq arisin (4) - 1 freq addeetion (4) - 3 freq assertin (4) - 2 freq adventirs (4) - 12 freq devisin (4) - 7 freq deridin (4) - 1 freq advertisement (4) - 2 freq dertin (4) - 1 freq energisin (4) - 1 freq appetising (4) - 1 freq |
advertisin (0) - 8 freq advertising (2) - 6 freq adverteesin (2) - 4 freq advertise (3) - 1 freq adverteisit (3) - 1 freq advertised (3) - 8 freq advertiser (3) - 1 freq adverteise (4) - 1 freq adverts (4) - 27 freq advertiseens (4) - 1 freq divertin (5) - 6 freq avertin (5) - 1 freq advertisers (5) - 2 freq advertisment (5) - 1 freq advisin (5) - 3 freq dereision (6) - 2 freq vertish (6) - 1 freq advert (6) - 32 freq digitisin (6) - 1 freq reversin (6) - 4 freq derision (6) - 8 freq adverbs (6) - 13 freq everthin (6) - 2 freq verbisan (6) - 3 freq diversion (6) - 4 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 - ATFRTSN advertisin - 8 freq adverteesin - 4 freq |
ADVERTISIN |
| Time to execute Levenshtein function - 0.226304 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.670176 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.030744 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.069132 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.000906 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. |