| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| uised (0) - 277 freq tised (1) - 1 freq uiser (1) - 5 freq yised (1) - 4 freq uized (1) - 21 freq uissed (1) - 4 freq uise (1) - 281 freq wised (1) - 1 freq aised (1) - 6 freq yuised (1) - 4 freq ruised (1) - 5 freq used (1) - 663 freq uises (1) - 36 freq risen (2) - 17 freq poised (2) - 6 freq lisped (2) - 1 freq guiser (2) - 1 freq lied (2) - 15 freq uisge (2) - 5 freq luiked (2) - 74 freq pisen (2) - 1 freq sized (2) - 13 freq suited (2) - 15 freq yuise (2) - 10 freq bruised (2) - 15 freq |
uised (0) - 277 freq yuised (1) - 4 freq used (1) - 663 freq yised (1) - 4 freq aised (1) - 6 freq yaised (2) - 238 freq sed (2) - 175 freq oosed (2) - 1 freq eesed (2) - 65 freq aesed (2) - 2 freq oesed (2) - 3 freq eused (2) - 1 freq yased (2) - 18 freq isd (2) - 1 freq usd (2) - 1 freq uissed (2) - 4 freq uized (2) - 21 freq uiser (2) - 5 freq tised (2) - 1 freq eased (2) - 3 freq uise (2) - 281 freq uises (2) - 36 freq ruised (2) - 5 freq wised (2) - 1 freq uiss (3) - 130 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 |
UISED use - 457 freq used - 663 freq using - 35 freq usin - 94 freq user - 3 freq uised - 277 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.166513 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.353625 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.027553 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.036741 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.000943 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. |