| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| uised (0) - 281 freq used (1) - 682 freq wised (1) - 1 freq uise (1) - 281 freq ruised (1) - 5 freq tised (1) - 1 freq yuised (1) - 4 freq yised (1) - 4 freq uiser (1) - 5 freq uissed (1) - 4 freq uized (1) - 21 freq uises (1) - 36 freq aised (1) - 6 freq aise (2) - 14 freq muived (2) - 22 freq ried (2) - 2 freq kisted (2) - 1 freq unwed (2) - 1 freq oiled (2) - 1 freq mited (2) - 1 freq kissed (2) - 66 freq 'uises (2) - 1 freq hired (2) - 27 freq piked (2) - 3 freq gi'ed (2) - 2 freq |
uised (0) - 281 freq aised (1) - 6 freq yised (1) - 4 freq yuised (1) - 4 freq used (1) - 682 freq yaised (2) - 238 freq yased (2) - 18 freq sed (2) - 175 freq eased (2) - 3 freq eesed (2) - 65 freq isd (2) - 1 freq usd (2) - 1 freq aesed (2) - 2 freq oesed (2) - 3 freq oosed (2) - 1 freq tised (2) - 1 freq ruised (2) - 5 freq uise (2) - 281 freq wised (2) - 1 freq eused (2) - 1 freq uiser (2) - 5 freq uises (2) - 36 freq uissed (2) - 4 freq uized (2) - 21 freq uisein (3) - 9 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 - UST used - 682 freq uised - 281 freq uist - 15 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 |
UISED use - 466 freq used - 682 freq using - 35 freq usin - 97 freq user - 3 freq uised - 281 freq uise - 281 freq uises - 36 freq uiser - 5 freq aised - 6 freq yised - 4 freq yuised - 4 freq uissed - 4 freq uized - 21 freq |
| Time to execute Levenshtein function - 0.188081 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.325300 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.027461 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.036845 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.000963 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. |