| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| beegest (0) - 1 freq weeest (2) - 2 freq beeces (2) - 1 freq beget (2) - 2 freq wee-est (2) - 23 freq deepest (2) - 18 freq bigest (2) - 1 freq bestest (2) - 5 freq beest (2) - 11 freq breest (2) - 23 freq biggest (2) - 141 freq glegest (2) - 1 freq beeger (2) - 6 freq keenest (2) - 1 freq wee'est (2) - 2 freq behest (2) - 2 freq weetest (2) - 1 freq baagest (2) - 7 freq weeiest (2) - 1 freq beeriett (3) - 2 freq sleekest (3) - 1 freq baddest (3) - 1 freq peegs (3) - 1 freq ferget (3) - 2 freq edfest (3) - 3 freq |
beegest (0) - 1 freq bigest (2) - 1 freq baagest (2) - 7 freq beest (3) - 11 freq biggest (3) - 141 freq breest (3) - 23 freq behest (3) - 2 freq beget (3) - 2 freq beset (4) - 4 freq buget (4) - 1 freq gest (4) - 1 freq biggist (4) - 2 freq breist (4) - 69 freq baest (4) - 27 freq braest (4) - 1 freq digest (4) - 5 freq begat (4) - 2 freq briest (4) - 5 freq begs (4) - 11 freq breesty (4) - 1 freq ingest (4) - 2 freq yingest (4) - 2 freq braaest (4) - 2 freq yungest (4) - 3 freq bluest (4) - 1 freq |
SoundEx code - B223 begowkt - 1 freq biggest - 141 freq besieged - 2 freq begeckit - 1 freq begaikit - 1 freq beseeched - 1 freq biggist - 2 freq bogwhistle - 1 freq bigest - 1 freq besocht - 2 freq bequesting - 1 freq begowkit - 3 freq busiest - 3 freq baagest - 7 freq beegest - 1 freq beswakkit - 1 freq bequestin - 1 freq beseigit - 1 freq bbcquestiontime - 6 freq bxhksdm - 1 freq bookweekscot - 9 freq bjiokqhtoo - 1 freq bookweekscotland - 4 freq bbceastscot - 7 freq |
MetaPhone code - BJST bigest - 1 freq baagest - 7 freq beegest - 1 freq |
BEEGEST |
| Time to execute Levenshtein function - 0.202629 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.355729 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.027606 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.041824 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.001033 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. |