| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| advert (0) - 32 freq adverts (1) - 27 freq advent (1) - 8 freq adverb (1) - 3 freq avert (1) - 1 freq havert (2) - 1 freq albert (2) - 25 freq cuvert (2) - 1 freq divert (2) - 17 freq avery (2) - 2 freq appert (2) - 1 freq haavert (2) - 1 freq alert (2) - 17 freq dovert (2) - 9 freq assert (2) - 7 freq laddert (2) - 1 freq averts (2) - 1 freq fivert (2) - 2 freq covert (2) - 39 freq apert (2) - 12 freq dyvert (2) - 1 freq livert (2) - 1 freq addet (2) - 25 freq revert (2) - 4 freq aseert (2) - 1 freq |
advert (0) - 32 freq daivert (2) - 2 freq divert (2) - 17 freq dyvert (2) - 1 freq davert (2) - 1 freq dovert (2) - 9 freq adverts (2) - 27 freq advent (2) - 8 freq adverb (2) - 3 freq avert (2) - 1 freq favert (3) - 1 freq doverit (3) - 1 freq livert (3) - 1 freq revert (3) - 4 freq kivert (3) - 4 freq severt (3) - 1 freq taivert (3) - 2 freq adverse (3) - 1 freq overt (3) - 4 freq vert (3) - 1 freq havert (3) - 1 freq cuvert (3) - 1 freq haavert (3) - 1 freq covert (3) - 39 freq fivert (3) - 2 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 - ATFRT advert - 32 freq |
ADVERT |
| Time to execute Levenshtein function - 0.204380 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.389567 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.029157 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.040122 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.000945 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. |