| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| uni (0) - 53 freq uri (1) - 7 freq kni (1) - 1 freq une (1) - 4 freq xni (1) - 1 freq unk (1) - 1 freq uno (1) - 1 freq £ni (1) - 2 freq unt (1) - 1 freq ung (1) - 1 freq ui (1) - 6 freq wuni (1) - 1 freq unis (1) - 2 freq unn (1) - 5 freq und (1) - 12 freq oni (1) - 1 freq puni (1) - 25 freq uhi (1) - 1 freq uki (1) - 2 freq ni (1) - 30 freq unit (1) - 42 freq un (1) - 31 freq uup (2) - 4 freq tfi (2) - 2 freq usa (2) - 52 freq |
uni (0) - 53 freq oni (1) - 1 freq un (1) - 31 freq uno (1) - 1 freq ni (1) - 30 freq une (1) - 4 freq yn (2) - 6 freq oun (2) - 14 freq unyo (2) - 1 freq eno (2) - 9 freq ono (2) - 3 freq nu (2) - 10 freq uun (2) - 1 freq in (2) - 45098 freq en (2) - 618 freq yun (2) - 140 freq ne (2) - 86 freq onie (2) - 778 freq ane (2) - 2140 freq any (2) - 719 freq ynu (2) - 9 freq uneo (2) - 1 freq ena (2) - 16 freq one (2) - 766 freq eny (2) - 7 freq |
SoundEx code - U500 um - 151 freq uhm - 1 freq 'um - 35 freq uni - 53 freq un - 31 freq ume - 2 freq umah - 1 freq unn - 5 freq uim - 1 freq une - 4 freq uuno - 1 freq uneo - 1 freq €˜um - 33 freq uon - 1 freq uno - 1 freq unyo - 1 freq umae - 1 freq uiwm - 1 freq uun - 1 freq |
MetaPhone code - UN uni - 53 freq un - 31 freq unn - 5 freq une - 4 freq uuno - 1 freq uneo - 1 freq uon - 1 freq uno - 1 freq uun - 1 freq |
UNI |
| Time to execute Levenshtein function - 0.178144 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.316050 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.027404 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.039908 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.001232 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. |