| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| ucht (0) - 1 freq oucht (1) - 21 freq aucht (1) - 33 freq echt (1) - 115 freq acht (1) - 14 freq bucht (1) - 4 freq ocht (1) - 317 freq ncht (1) - 5 freq uch (1) - 3 freq mcht (1) - 1 freq ct (2) - 8 freq ruht (2) - 1 freq buckt (2) - 1 freq ht (2) - 8 freq caucht (2) - 32 freq nocht (2) - 211 freq ect (2) - 25 freq tch (2) - 3 freq iht (2) - 1 freq 'ch' (2) - 2 freq brht (2) - 1 freq suiht (2) - 1 freq techt (2) - 2 freq macht (2) - 3 freq socht (2) - 143 freq |
ucht (0) - 1 freq oucht (1) - 21 freq acht (1) - 14 freq ocht (1) - 317 freq echt (1) - 115 freq aucht (1) - 33 freq aicht (2) - 33 freq chat (2) - 71 freq ouecht (2) - 1 freq echty (2) - 22 freq eaucht (2) - 1 freq achty (2) - 1 freq aacht (2) - 5 freq chit (2) - 4 freq ncht (2) - 5 freq bucht (2) - 4 freq yacht (2) - 11 freq uch (2) - 3 freq mcht (2) - 1 freq eicht (2) - 61 freq hecht (3) - 47 freq cet (3) - 1 freq wicht (3) - 11 freq nicht (3) - 2275 freq lecht (3) - 3 freq |
SoundEx code - U230 used - 682 freq uised - 281 freq uist - 15 freq use't - 13 freq ucht - 1 freq uissed - 4 freq usit - 4 freq usta - 1 freq ustae - 2 freq uized - 21 freq uisst - 1 freq usty - 1 freq uggit - 1 freq ushed - 1 freq uisit - 7 freq usetae - 1 freq uk-wide - 1 freq used - 1 freq usd - 1 freq uzid - 1 freq uujde - 1 freq |
MetaPhone code - UXT ucht - 1 freq ushed - 1 freq |
UCHT |
| Time to execute Levenshtein function - 0.181258 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.334279 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.028242 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.037722 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.000947 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. |