| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| uwtk (0) - 1 freq fwtk (1) - 1 freq uwtx (1) - 1 freq butk (2) - 1 freq tk (2) - 3 freq uok (2) - 1 freq watk (2) - 2 freq unt (2) - 1 freq datk (2) - 1 freq wth (2) - 1 freq xxtk (2) - 1 freq uork (2) - 1 freq uerk (2) - 1 freq uik (2) - 1 freq kwik (2) - 2 freq wak (2) - 53 freq ftk (2) - 1 freq qwak (2) - 1 freq awte (2) - 1 freq wwdtk (2) - 1 freq utj (2) - 1 freq unk (2) - 1 freq uwcl (2) - 1 freq upt (2) - 2 freq ut (2) - 9 freq |
uwtk (0) - 1 freq uwtx (2) - 1 freq watk (2) - 2 freq fwtk (2) - 1 freq awta (3) - 1 freq wlk (3) - 1 freq owte (3) - 2 freq wk (3) - 11 freq ytk (3) - 1 freq awk (3) - 1 freq owt (3) - 10 freq wtt (3) - 1 freq wok (3) - 1 freq wik (3) - 116 freq wt (3) - 5 freq wtg (3) - 1 freq ewok (3) - 1 freq awak (3) - 1 freq jtk (3) - 4 freq uptak (3) - 14 freq tutk (3) - 1 freq wt' (3) - 1 freq wtf (3) - 14 freq wth (3) - 1 freq ftk (3) - 1 freq |
SoundEx code - U320 uouadays - 1 freq udqa - 1 freq udkja - 1 freq uwtk - 1 freq utq - 2 freq utj - 1 freq uwtx - 1 freq |
MetaPhone code - UTK udqa - 1 freq uwtk - 1 freq utq - 2 freq |
UWTK |
| Time to execute Levenshtein function - 0.484850 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.605040 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.032026 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.070460 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.000879 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. |