| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| whichuk (0) - 1 freq which (2) - 1103 freq which'd (2) - 1 freq hicht (3) - 47 freq chick (3) - 16 freq hich (3) - 7 freq wricht (3) - 15 freq whuch (3) - 25 freq whitsup (3) - 1 freq wheichit (3) - 1 freq whitsun (3) - 1 freq whither (3) - 132 freq wicht (3) - 11 freq wichts (3) - 3 freq shicht (3) - 2 freq whilk (3) - 193 freq chuk (3) - 1 freq hichts (3) - 10 freq wheiched (3) - 4 freq weich (3) - 2 freq thick (3) - 218 freq whisht (3) - 3 freq weicht (3) - 29 freq wheichs (3) - 1 freq whice (3) - 1 freq |
whichuk (0) - 1 freq which (3) - 1103 freq wheichit (4) - 1 freq whack (4) - 15 freq wheiched (4) - 4 freq whuch (4) - 25 freq wheichs (4) - 1 freq which'd (4) - 1 freq whiech (4) - 3 freq 'which (5) - 8 freq waicht (5) - 9 freq whisk (5) - 2 freq wich (5) - 1 freq whitlik (5) - 35 freq weiched (5) - 1 freq weichty (5) - 1 freq wheecht (5) - 10 freq wheechin (5) - 40 freq wheecher (5) - 2 freq wheechs (5) - 10 freq wheech (5) - 90 freq whitch (5) - 1 freq whict (5) - 1 freq wheeched (5) - 47 freq hicher (5) - 1 freq |
SoundEx code - W220 wisses - 4 freq wishes - 36 freq wages - 39 freq wauges - 1 freq wakes - 10 freq wash-hoose - 2 freq wheechs - 10 freq washes - 10 freq whiskies - 3 freq wheezes - 1 freq wcis - 1 freq wuzzack - 1 freq waashes - 4 freq weejies - 1 freq weighs - 3 freq wushes - 1 freq weeshes - 1 freq wises - 1 freq wissis - 1 freq weeshy-washy - 1 freq whiskas - 1 freq waikiki - 2 freq weishes - 3 freq wuzzies - 1 freq washhous - 1 freq wheichs - 1 freq whuskies - 1 freq weekis - 1 freq whizzes - 1 freq wishy-waashy - 1 freq wazzie's - 1 freq wusses - 1 freq wojciech - 1 freq waxes - 1 freq wghx - 1 freq weegies - 9 freq whiskeys - 4 freq wxqeaooquh - 1 freq washhoose - 1 freq wcijyo - 1 freq wxis - 1 freq whichuk - 1 freq whassigo - 1 freq |
MetaPhone code - WXK whichuk - 1 freq |
WHICHUK |
| Time to execute Levenshtein function - 0.237759 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.317113 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.027626 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.036793 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.000750 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. |