| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| adverts (0) - 27 freq adverbs (1) - 13 freq advert (1) - 32 freq averts (1) - 1 freq advertise (2) - 1 freq adverse (2) - 1 freq derts (2) - 2 freq diverts (2) - 2 freq aerts (2) - 1 freq avert (2) - 1 freq adverb (2) - 3 freq coverts (2) - 1 freq asserts (2) - 1 freq adders (2) - 1 freq advent (2) - 8 freq covert (3) - 39 freq avery (3) - 2 freq fivers (3) - 3 freq averse (3) - 6 freq derth (3) - 2 freq arrests (3) - 1 freq adder (3) - 4 freq dorts (3) - 8 freq fadder's (3) - 7 freq adults (3) - 49 freq |
adverts (0) - 27 freq advertise (2) - 1 freq averts (2) - 1 freq diverts (2) - 2 freq advert (2) - 32 freq adverbs (2) - 13 freq coverts (3) - 1 freq derts (3) - 2 freq adverse (3) - 1 freq adverteise (3) - 1 freq dwarts (4) - 1 freq dyvert (4) - 1 freq divert (4) - 17 freq daivert (4) - 2 freq deserts (4) - 8 freq darts (4) - 32 freq advertisin (4) - 8 freq duvets (4) - 1 freq diver's (4) - 1 freq divers (4) - 10 freq advertised (4) - 8 freq dirts (4) - 1 freq dairts (4) - 2 freq advertiser (4) - 1 freq davert (4) - 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 - ATFRTS adverts - 27 freq advertise - 1 freq adverteise - 1 freq |
ADVERTS |
| Time to execute Levenshtein function - 0.188374 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.330733 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.027565 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.037680 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. |