| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| uisst (0) - 1 freq yuisst (1) - 5 freq uisit (1) - 7 freq uiss (1) - 130 freq uist (1) - 9 freq misst (1) - 11 freq kisst (1) - 6 freq wisst (1) - 5 freq aiss (2) - 3 freq uissed (2) - 4 freq kiss (2) - 120 freq meisst (2) - 1 freq visit (2) - 146 freq piss (2) - 72 freq kist (2) - 116 freq pist (2) - 3 freq jiist (2) - 1 freq juist (2) - 1704 freq liss (2) - 2 freq guesst (2) - 5 freq 'iss (2) - 1 freq cosst (2) - 1 freq yinst (2) - 77 freq huirst (2) - 1 freq 'is't (2) - 1 freq |
uisst (0) - 1 freq yuisst (1) - 5 freq suist (2) - 1 freq wisst (2) - 5 freq sist (2) - 5 freq kisst (2) - 6 freq issit (2) - 1 freq uisit (2) - 7 freq misst (2) - 11 freq uist (2) - 9 freq uiss (2) - 130 freq gist (3) - 13 freq uissis (3) - 1 freq uissan (3) - 3 freq aist (3) - 21 freq unst (3) - 12 freq uissfu (3) - 18 freq usit (3) - 4 freq mosst (3) - 53 freq iss (3) - 480 freq yuiss (3) - 16 freq risit (3) - 1 freq uisses (3) - 2 freq tosst (3) - 1 freq missty (3) - 1 freq |
SoundEx code - U230 used - 663 freq uised - 277 freq uist - 9 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 - UST used - 663 freq uised - 277 freq uist - 9 freq use't - 13 freq uissed - 4 freq usit - 4 freq usta - 1 freq ustae - 2 freq uized - 21 freq uisst - 1 freq usty - 1 freq uisit - 7 freq usetae - 1 freq used - 1 freq usd - 1 freq uzid - 1 freq |
UISST |
| Time to execute Levenshtein function - 0.193842 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.351137 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.027391 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.041038 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.000828 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. |