| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| ussdg (0) - 1 freq ssrg (2) - 1 freq used (2) - 682 freq usd (2) - 1 freq using (2) - 35 freq ssd (2) - 12 freq ussr (2) - 3 freq ussf (2) - 2 freq bussed (3) - 3 freq sidn (3) - 1 freq smg (3) - 1 freq hss (3) - 1 freq ulg (3) - 1 freq sod (3) - 22 freq psg (3) - 3 freq ustae (3) - 2 freq ud (3) - 4 freq sud (3) - 92 freq usty (3) - 1 freq snag (3) - 1 freq iss- (3) - 1 freq mussil (3) - 1 freq suds (3) - 3 freq asyde (3) - 13 freq shug (3) - 21 freq |
ussdg (0) - 1 freq ssd (3) - 12 freq ssrg (3) - 1 freq assed (4) - 1 freq sedge (4) - 1 freq sadge (4) - 1 freq uissage (4) - 3 freq ussr (4) - 3 freq usd (4) - 1 freq used (4) - 682 freq using (4) - 35 freq uissed (4) - 4 freq ussf (4) - 2 freq sbd (5) - 2 freq aspd (5) - 1 freq spag (5) - 2 freq isss (5) - 1 freq hadg (5) - 1 freq sndd (5) - 1 freq shag (5) - 14 freq sussie (5) - 1 freq msdc (5) - 1 freq sed (5) - 175 freq sad (5) - 205 freq pussed (5) - 4 freq |
SoundEx code - U232 ussdg - 1 freq uketzwbgjm - 1 freq uiowctgh - 1 freq |
MetaPhone code - USTK ussdg - 1 freq |
USSDG |
| Time to execute Levenshtein function - 0.236183 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.387605 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.027838 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.038431 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.000953 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. |