| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| ugsome (0) - 65 freq uggsome (1) - 7 freq €œsome (2) - 11 freq gome (2) - 1 freq €™some (2) - 1 freq aesome (2) - 6 freq gnome (2) - 2 freq wulsome (2) - 2 freq awsome (2) - 2 freq bosome (2) - 1 freq eesome (2) - 2 freq ugsumm (2) - 1 freq 'some (2) - 11 freq €˜some (2) - 5 freq fulsome (2) - 1 freq some (2) - 4095 freq luesome (2) - 2 freq upcome (2) - 2 freq fusome (2) - 1 freq ugsum (2) - 2 freq ugsomely (2) - 1 freq 'gome (2) - 1 freq insole (3) - 1 freq gove (3) - 14 freq oÂ’some (3) - 1 freq |
ugsome (0) - 65 freq ugsum (2) - 2 freq uggsome (2) - 7 freq 'some (3) - 11 freq ugsumm (3) - 1 freq luesome (3) - 2 freq fusome (3) - 1 freq ugsomely (3) - 1 freq eesome (3) - 2 freq some (3) - 4095 freq gome (3) - 1 freq bosome (3) - 1 freq aesome (3) - 6 freq gnome (3) - 2 freq awsome (3) - 2 freq 'same (4) - 3 freq goom (4) - 1 freq awsom (4) - 1 freq game (4) - 642 freq genome (4) - 2 freq gsoh (4) - 2 freq bisom (4) - 5 freq sesame (4) - 2 freq syme (4) - 22 freq awesome (4) - 35 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 - UKSM ugsome - 65 freq uggsome - 7 freq ugsumm - 1 freq ugsum - 2 freq |
UGSOME |
| Time to execute Levenshtein function - 0.185029 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.341176 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.027081 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.037290 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.000757 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. |