Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
---|---|---|---|---|
aydbr (0) - 1 freq cydbd (2) - 1 freq ryder (2) - 1 freq syder (2) - 5 freq aydea (2) - 1 freq ayar (2) - 1 freq ayur (2) - 1 freq aybba (2) - 1 freq ay'be (2) - 1 freq sydb (2) - 1 freq ayday (2) - 1 freq aider (2) - 2 freq adder (2) - 4 freq ayr (2) - 71 freq alder (2) - 1 freq ar (3) - 208 freq -ye'r (3) - 1 freq yar (3) - 3 freq aab (3) - 3 freq adda (3) - 4 freq gaddir (3) - 1 freq arab (3) - 4 freq absby (3) - 1 freq gander (3) - 14 freq zodr (3) - 1 freq |
aydbr (0) - 1 freq adder (3) - 4 freq aider (3) - 2 freq dyker (4) - 4 freq libr (4) - 1 freq dyr (4) - 1 freq adair (4) - 1 freq dobro (4) - 1 freq amber (4) - 13 freq db (4) - 2 freq dbn (4) - 1 freq dyvor (4) - 1 freq dfr (4) - 2 freq odder (4) - 1 freq der (4) - 303 freq adobe (4) - 2 freq idder (4) - 286 freq eader (4) - 1 freq dar (4) - 86 freq adore (4) - 12 freq udhr (4) - 1 freq cebr (4) - 1 freq udr (4) - 1 freq br (4) - 4 freq dr (4) - 199 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 - ATBR aydbr - 1 freq |
AYDBR |
Time to execute Levenshtein function - 0.236189 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.404066 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.029095 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.042263 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.000835 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. |