| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| uno (0) - 1 freq unn (1) - 5 freq upo (1) - 67 freq ano (1) - 6 freq un (1) - 31 freq dno (1) - 1 freq 'no (1) - 89 freq xno (1) - 1 freq uneo (1) - 1 freq uuno (1) - 1 freq unyo (1) - 1 freq undo (1) - 1 freq unto (1) - 8 freq ono (1) - 3 freq ung (1) - 1 freq juno (1) - 2 freq eno (1) - 9 freq unk (1) - 1 freq une (1) - 4 freq kno (1) - 16 freq uo (1) - 4 freq uni (1) - 53 freq sno (1) - 1 freq unco (1) - 328 freq uao (1) - 1 freq |
uno (0) - 1 freq ono (1) - 3 freq unyo (1) - 1 freq eno (1) - 9 freq uni (1) - 53 freq une (1) - 4 freq uneo (1) - 1 freq uuno (1) - 1 freq un (1) - 31 freq ino (1) - 2 freq ano (1) - 6 freq no (1) - 10287 freq enoo (2) - 8 freq inoo (2) - 10 freq ena (2) - 16 freq ony (2) - 2222 freq any (2) - 719 freq eny (2) - 7 freq ana (2) - 143 freq yn (2) - 6 freq in (2) - 45098 freq iano (2) - 1 freq nuo (2) - 1 freq ina (2) - 99 freq uun (2) - 1 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 |
UNO |
| Time to execute Levenshtein function - 0.218143 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.324929 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.027490 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.042044 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.001080 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. |