| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| yokit (0) - 73 freq yokit' (1) - 1 freq yoit (1) - 1 freq yokkit (1) - 4 freq jokit (1) - 8 freq pokit (1) - 7 freq yokkt (1) - 3 freq yokin (1) - 24 freq yowkit (1) - 2 freq yockit (1) - 5 freq poakit (2) - 26 freq cakit (2) - 1 freq coit (2) - 7 freq boukit (2) - 5 freq roit (2) - 1 freq rowit (2) - 1 freq yokin' (2) - 1 freq poket (2) - 4 freq gowkit (2) - 6 freq yowt (2) - 1 freq yok (2) - 2 freq kit (2) - 31 freq evokit (2) - 1 freq iikit (2) - 1 freq hikit (2) - 2 freq |
yokit (0) - 73 freq ekit (2) - 1 freq eekit (2) - 6 freq eikit (2) - 65 freq yokit' (2) - 1 freq kit (2) - 31 freq iikit (2) - 1 freq yowkit (2) - 2 freq yockit (2) - 5 freq yokkit (2) - 4 freq yoit (2) - 1 freq yokin (2) - 24 freq jokit (2) - 8 freq yokkt (2) - 3 freq pokit (2) - 7 freq oolit (3) - 2 freq yoked (3) - 1 freq soakit (3) - 4 freq yerkit (3) - 3 freq wooit (3) - 1 freq yalkit (3) - 1 freq joukit (3) - 16 freq yokk (3) - 7 freq yit (3) - 500 freq bikit (3) - 1 freq |
SoundEx code - Y230 yokit - 73 freq yist - 14 freq yased - 18 freq yaised - 238 freq yaized - 5 freq yacht - 11 freq yuisst - 5 freq yuist - 2 freq yoost - 1 freq yoosed - 1 freq yaist - 21 freq yest - 2 freq yuised - 4 freq yazed - 1 freq yiggid - 1 freq yaisit - 4 freq yokit' - 1 freq yeuched - 2 freq yeast - 11 freq yocked - 1 freq yakkit - 2 freq yockit - 5 freq yokkt - 3 freq yokkit - 4 freq yoostae - 4 freq yowkit - 2 freq yoked - 1 freq yeesed - 1 freq yeusd - 2 freq yjd - 1 freq yised - 4 freq ysthie - 1 freq ygt - 1 freq yessaday - 1 freq yset - 2 freq yxd - 1 freq |
MetaPhone code - YKT yokit - 73 freq yiggid - 1 freq yokit' - 1 freq yocked - 1 freq yakkit - 2 freq yockit - 5 freq yokkt - 3 freq yokkit - 4 freq yowkit - 2 freq yoked - 1 freq |
YOKIT |
| Time to execute Levenshtein function - 0.196573 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.337352 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.028416 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.037115 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.001028 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. |