Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
---|---|---|---|---|
uist (0) - 9 freq uisit (1) - 7 freq buist (1) - 5 freq suist (1) - 1 freq sist (1) - 5 freq cuist (1) - 14 freq gist (1) - 13 freq dist (1) - 18 freq luist (1) - 4 freq uis (1) - 17 freq aist (1) - 21 freq uise (1) - 281 freq fist (1) - 55 freq rist (1) - 15 freq jist (1) - 6672 freq list (1) - 191 freq tist (1) - 1 freq ist (1) - 11 freq yist (1) - 14 freq cist (1) - 1 freq wist (1) - 3 freq uiss (1) - 130 freq juist (1) - 1704 freq kist (1) - 116 freq yuist (1) - 2 freq |
uist (0) - 9 freq aist (1) - 21 freq yist (1) - 14 freq yuist (1) - 2 freq uisit (1) - 7 freq ist (1) - 11 freq st (2) - 378 freq duist (2) - 1 freq mist (2) - 81 freq pist (2) - 3 freq ruist (2) - 1 freq est (2) - 22 freq sit (2) - 642 freq yaist (2) - 21 freq suit (2) - 159 freq eest (2) - 24 freq iste (2) - 1 freq usta (2) - 1 freq usit (2) - 4 freq east (2) - 304 freq uisst (2) - 1 freq aest (2) - 21 freq usty (2) - 1 freq isit (2) - 1 freq yest (2) - 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 |
UIST |
Time to execute Levenshtein function - 0.180989 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.315991 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.027217 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.036588 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.000829 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. |