| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| ussr (0) - 3 freq ussf (1) - 2 freq user (1) - 3 freq ssrg (2) - 1 freq usy (2) - 1 freq urr (2) - 43 freq sir (2) - 356 freq jsr (2) - 1 freq esso (2) - 5 freq udhr (2) - 1 freq usbf (2) - 14 freq fuss (2) - 20 freq mussy (2) - 3 freq ufer (2) - 1 freq users (2) - 7 freq ssre (2) - 1 freq sssa (2) - 8 freq ssp (2) - 8 freq ssm (2) - 1 freq sqr (2) - 1 freq us' (2) - 2 freq uner (2) - 2 freq ssh (2) - 1 freq lss (2) - 1 freq uise (2) - 281 freq |
ussr (0) - 3 freq ssre (2) - 1 freq user (2) - 3 freq ussf (2) - 2 freq hussar (3) - 2 freq isss (3) - 1 freq sar (3) - 1 freq auss (3) - 2 freq us're (3) - 1 freq uiss (3) - 130 freq iss' (3) - 1 freq yesser (3) - 1 freq sur (3) - 22 freq unser (3) - 3 freq sss (3) - 1 freq rosr (3) - 1 freq uisst (3) - 1 freq ssl (3) - 1 freq usher (3) - 3 freq ssd (3) - 12 freq str (3) - 1 freq eser (3) - 1 freq aser (3) - 1 freq ess (3) - 258 freq asseir (3) - 1 freq |
SoundEx code - U260 us're - 1 freq usher - 3 freq user - 3 freq ussr - 3 freq uiser - 5 freq usri - 3 freq uksrw - 1 freq uighur - 34 freq ukxkr - 1 freq ueweaoijur - 1 freq ushare - 1 freq 'ushare' - 1 freq |
MetaPhone code - USR us're - 1 freq user - 3 freq ussr - 3 freq uiser - 5 freq usri - 3 freq |
USSR |
| Time to execute Levenshtein function - 0.197604 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.342330 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.028338 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.037864 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.000812 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. |