| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| amber (0) - 13 freq aaber (1) - 22 freq bamber (1) - 2 freq umber (1) - 2 freq camber (1) - 1 freq hammer (2) - 44 freq gambler (2) - 4 freq aaler (2) - 17 freq ombr (2) - 1 freq maimber (2) - 14 freq ueber (2) - 1 freq mbes (2) - 1 freq aller (2) - 1 freq meer (2) - 9 freq ame (2) - 3 freq ather (2) - 3 freq uber (2) - 2 freq camper (2) - 1 freq pamper (2) - 2 freq albert (2) - 25 freq comber (2) - 2 freq embed (2) - 2 freq ambled (2) - 1 freq alter (2) - 15 freq embers (2) - 7 freq |
amber (0) - 13 freq umber (1) - 2 freq aaber (2) - 22 freq ombr (2) - 1 freq camber (2) - 1 freq bamber (2) - 2 freq ber (3) - 4 freq mbe (3) - 4 freq lumber (3) - 5 freq maer (3) - 3 freq tuber (3) - 1 freq fyber (3) - 1 freq embra (3) - 96 freq ameter (3) - 1 freq embro (3) - 86 freq yammer (3) - 5 freq member (3) - 75 freq weber (3) - 1 freq tiber (3) - 1 freq bomber (3) - 3 freq limber (3) - 2 freq eber (3) - 3 freq amble (3) - 3 freq number (3) - 174 freq amour (3) - 1 freq |
SoundEx code - A516 anniversary - 28 freq amber - 13 freq anniversiry - 2 freq anniversaries - 1 freq awenbracin - 1 freq anniversery - 1 freq ambroise - 2 freq ambrosianae' - 1 freq anniversarie - 3 freq anniversar - 5 freq amphora - 1 freq €œane-pairty - 1 freq ambros - 1 freq €˜amber - 1 freq aimfor - 2 freq |
MetaPhone code - AMR ah'mur - 3 freq amber - 13 freq aumry - 1 freq amor - 1 freq amara - 1 freq amore - 1 freq aumrie - 3 freq amour - 1 freq €˜amber - 1 freq amorra - 2 freq |
AMBER |
| Time to execute Levenshtein function - 0.237405 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.373606 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.028169 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.038378 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.000942 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. |