| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| advertisment (0) - 1 freq advertisement (1) - 2 freq advertisements (2) - 1 freq advertiseens (2) - 1 freq adverteisements (3) - 1 freq advertisin (3) - 8 freq advertising (3) - 6 freq advertiser (3) - 1 freq advertised (3) - 8 freq advertisers (3) - 2 freq advertise (3) - 1 freq divertimento (4) - 1 freq adverteisit (4) - 1 freq derailment (4) - 2 freq aveisement (4) - 4 freq adverteise (4) - 1 freq sentiment (5) - 16 freq assortment (5) - 2 freq adherent (5) - 1 freq airgiement (5) - 2 freq aert-kent (5) - 1 freq adverse (5) - 1 freq deevilment (5) - 2 freq airgiment (5) - 1 freq government (5) - 440 freq |
advertisment (0) - 1 freq advertisement (1) - 2 freq advertisements (3) - 1 freq adverteisements (4) - 1 freq advertiseens (4) - 1 freq divertimento (5) - 1 freq advertising (5) - 6 freq advertisin (5) - 8 freq advertise (6) - 1 freq adverteisit (6) - 1 freq advertisers (6) - 2 freq advertiser (6) - 1 freq advertised (6) - 8 freq adverteesin (7) - 4 freq adverteise (7) - 1 freq aveisement (7) - 4 freq derailment (7) - 2 freq guvernment (8) - 1 freq entertainment (8) - 26 freq investment (8) - 23 freq adverts (8) - 27 freq governament (8) - 1 freq apairtment (8) - 3 freq apartment (8) - 6 freq devilment (8) - 3 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 - ATFRTSMN |
ADVERTISMENT |
| Time to execute Levenshtein function - 0.591334 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.624575 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.066599 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.044364 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.001185 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. |