| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| uzn (0) - 1 freq zn (1) - 1 freq uzp (1) - 1 freq urn (1) - 6 freq un (1) - 31 freq uzo (1) - 1 freq upn (1) - 1 freq unn (1) - 5 freq uun (1) - 1 freq xzn (1) - 1 freq mzn (1) - 1 freq uz (1) - 50 freq uon (1) - 1 freq uzh (1) - 2 freq hwn (2) - 1 freq qzt (2) - 1 freq usp (2) - 1 freq utb (2) - 1 freq ez (2) - 5 freq ahn (2) - 1 freq uim (2) - 1 freq zx (2) - 1 freq gun (2) - 81 freq wza (2) - 1 freq han (2) - 393 freq |
uzn (0) - 1 freq zn (1) - 1 freq uzh (2) - 2 freq mzn (2) - 1 freq uz (2) - 50 freq zen (2) - 8 freq izna (2) - 3 freq uizin (2) - 12 freq xzn (2) - 1 freq uon (2) - 1 freq uzp (2) - 1 freq uun (2) - 1 freq urn (2) - 6 freq uzo (2) - 1 freq un (2) - 31 freq unn (2) - 5 freq upn (2) - 1 freq zi (3) - 3 freq muin (3) - 100 freq inn (3) - 29 freq hn (3) - 3 freq uapn (3) - 1 freq iz (3) - 434 freq azl (3) - 1 freq fuan (3) - 2 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 - USN usin - 97 freq uisin - 105 freq uissin - 1 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 |
UZN |
| Time to execute Levenshtein function - 0.197734 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.340394 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.028987 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.037594 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.000916 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. |