| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| begowkit (0) - 3 freq begowkin (1) - 5 freq begowkt (1) - 1 freq begowks (2) - 1 freq begowk (2) - 2 freq begeckit (2) - 1 freq begaikit (2) - 1 freq begunkit (2) - 8 freq gowkit (2) - 6 freq gowkin (3) - 2 freq chowkit (3) - 2 freq €œgawkit (3) - 1 freq belovit (3) - 5 freq snowkit (3) - 1 freq gowlit (3) - 1 freq boukit (3) - 5 freq broukit (3) - 21 freq begoot (3) - 2 freq gowpit (3) - 10 freq yowkit (3) - 2 freq behookie (3) - 1 freq begot (3) - 1 freq beekit (3) - 2 freq blokkit (3) - 1 freq bookit (3) - 3 freq |
begowkit (0) - 3 freq begowkt (1) - 1 freq begowkin (2) - 5 freq begunkit (3) - 8 freq begaikit (3) - 1 freq gowkit (3) - 6 freq begeckit (3) - 1 freq begowk (3) - 2 freq begowks (3) - 1 freq gawkit (4) - 9 freq brawkit (4) - 1 freq bowtit (5) - 1 freq belikkit (5) - 1 freq gowkie (5) - 1 freq beukit (5) - 3 freq beskit (5) - 3 freq cowkit (5) - 1 freq bowlit (5) - 1 freq bekkit (5) - 1 freq gawkt (5) - 1 freq brockit (5) - 2 freq powkit (5) - 14 freq blockit (5) - 11 freq howkit (5) - 28 freq boakit (5) - 3 freq |
SoundEx code - B223 begowkt - 1 freq biggest - 137 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 - BKKT begowkt - 1 freq begaikit - 1 freq begowkit - 3 freq bbcqt - 1 freq |
BEGOWKIT |
| Time to execute Levenshtein function - 0.507197 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 - 1.075956 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.102822 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.110949 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.001049 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. |