Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
---|---|---|---|---|
uisin (0) - 105 freq uisin' (1) - 1 freq cuisin (1) - 1 freq ruisin (1) - 2 freq eisin (1) - 1 freq aisin (1) - 1 freq uising (1) - 2 freq uizin (1) - 12 freq wisin (1) - 11 freq uisein (1) - 9 freq guisin (1) - 30 freq risin (1) - 136 freq usin (1) - 94 freq uisit (1) - 7 freq bruisin (2) - 6 freq wirin (2) - 2 freq tirin (2) - 4 freq pipin (2) - 8 freq uiss (2) - 130 freq uis (2) - 17 freq hiein (2) - 1 freq iain (2) - 49 freq easin (2) - 11 freq ristin (2) - 3 freq cuikin (2) - 7 freq |
uisin (0) - 105 freq aisin (1) - 1 freq usin (1) - 94 freq uisein (1) - 9 freq eisin (1) - 1 freq aisan (2) - 1 freq yaisin (2) - 98 freq usan (2) - 4 freq yasin (2) - 15 freq sin (2) - 674 freq isn (2) - 20 freq oesin (2) - 1 freq eesin (2) - 1 freq easin (2) - 11 freq usain (2) - 1 freq aesin (2) - 2 freq uisit (2) - 7 freq uisin' (2) - 1 freq cuisin (2) - 1 freq ruisin (2) - 2 freq uizin (2) - 12 freq uising (2) - 2 freq guisin (2) - 30 freq risin (2) - 136 freq wisin (2) - 11 freq |
SoundEx code - U250 usin - 94 freq ugsome - 65 freq uggin - 3 freq uisin - 105 freq uggsome - 7 freq uckin - 1 freq uisein - 9 freq usin' - 1 freq usan - 4 freq uissan - 3 freq uscn - 61 freq uisin' - 1 freq -ukin - 1 freq uizin - 12 freq ugsumm - 1 freq ugsum - 2 freq usain - 1 freq uszxn - 1 freq uwxjm - 1 freq uzn - 1 freq |
MetaPhone code - USN usin - 94 freq uisin - 105 freq uisein - 9 freq usin' - 1 freq usan - 4 freq uissan - 3 freq uisin' - 1 freq uizin - 12 freq usain - 1 freq uzn - 1 freq |
UISIN |
Time to execute Levenshtein function - 0.206348 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.368262 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.031621 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.037917 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.000870 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. |