| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| uszxn (0) - 1 freq uscn (2) - 61 freq usan (2) - 4 freq uzn (2) - 1 freq usin (2) - 97 freq usman (2) - 1 freq usain (2) - 1 freq uizin (2) - 12 freq ufhx (3) - 1 freq 'soon (3) - 2 freq sorn (3) - 28 freq dushin (3) - 1 freq zn (3) - 1 freq bustan (3) - 1 freq lustin (3) - 1 freq uclzxd (3) - 1 freq usage (3) - 10 freq sin (3) - 676 freq rushin (3) - 17 freq whzxm (3) - 1 freq austin (3) - 5 freq 'son (3) - 2 freq xzx (3) - 1 freq bozen (3) - 1 freq son (3) - 532 freq |
uszxn (0) - 1 freq sizin (4) - 5 freq uizin (4) - 12 freq usman (4) - 1 freq saxon (4) - 6 freq usain (4) - 1 freq usin (4) - 97 freq uscn (4) - 61 freq usan (4) - 4 freq uzn (4) - 1 freq six (5) - 268 freq isbn (5) - 23 freq unsexin (5) - 1 freq sen (5) - 155 freq slx (5) - 1 freq ashen (5) - 2 freq sun (5) - 727 freq aspen (5) - 10 freq sinn (5) - 207 freq askin (5) - 183 freq osz (5) - 1 freq mpxn (5) - 1 freq sicn (5) - 1 freq austen (5) - 2 freq sex (5) - 72 freq |
SoundEx code - U250 usin - 97 freq ugsome - 65 freq uggin - 3 freq uisin - 105 freq uggsome - 7 freq uckin - 1 freq uissin - 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 - USSKSN uszxn - 1 freq |
USZXN |
| Time to execute Levenshtein function - 0.212347 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.381506 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.027456 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.037449 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.000852 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. |