Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
---|---|---|---|---|
uisses (0) - 2 freq hisses (1) - 4 freq fisses (1) - 1 freq misses (1) - 16 freq uissed (1) - 4 freq uises (1) - 36 freq uissis (1) - 1 freq wisses (1) - 4 freq kisses (1) - 29 freq yisses (1) - 2 freq pisses (1) - 4 freq ulysses (2) - 1 freq uisst (2) - 1 freq uses (2) - 47 freq uissin (2) - 1 freq buises (2) - 1 freq uissless (2) - 1 freq uiser (2) - 5 freq fishes (2) - 17 freq missed (2) - 198 freq masses (2) - 13 freq guesses (2) - 6 freq missis (2) - 2 freq missies (2) - 1 freq kissies (2) - 1 freq |
uisses (0) - 2 freq uissis (1) - 1 freq yisses (1) - 2 freq misses (2) - 16 freq asses (2) - 2 freq isss (2) - 1 freq hisses (2) - 4 freq pisses (2) - 4 freq issues (2) - 88 freq uissed (2) - 4 freq uises (2) - 36 freq fisses (2) - 1 freq kisses (2) - 29 freq wisses (2) - 4 freq wises (3) - 1 freq airses (3) - 3 freq sss (3) - 1 freq rissies (3) - 1 freq mosses (3) - 6 freq aisles (3) - 3 freq yasss (3) - 1 freq aises (3) - 1 freq fesses (3) - 1 freq messes (3) - 1 freq ruises (3) - 1 freq |
SoundEx code - U220 uses - 47 freq ukase - 1 freq uises - 36 freq uisage - 9 freq uisses - 2 freq uizes - 7 freq uissis - 1 freq uissage - 3 freq usage - 10 freq usige - 1 freq useco - 1 freq 'uises - 1 freq ujazqaa - 1 freq ukhka - 1 freq uzykj - 4 freq uxoc - 1 freq uigeach - 1 freq |
MetaPhone code - USS uses - 47 freq uises - 36 freq uisses - 2 freq uizes - 7 freq uissis - 1 freq 'uises - 1 freq |
UISSES |
Time to execute Levenshtein function - 0.180884 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.372550 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.033468 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.037115 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.000916 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. |