| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| uun (0) - 1 freq urn (1) - 6 freq tun (1) - 4 freq jun (1) - 7 freq uuno (1) - 1 freq upun (1) - 5 freq unn (1) - 5 freq guun (1) - 1 freq nun (1) - 10 freq run (1) - 634 freq gun (1) - 81 freq hun (1) - 9 freq lun (1) - 1 freq uuw (1) - 1 freq mun (1) - 20 freq sun (1) - 727 freq dun (1) - 36 freq fun (1) - 642 freq oun (1) - 14 freq uzn (1) - 1 freq yun (1) - 140 freq wun (1) - 200 freq uon (1) - 1 freq un (1) - 31 freq duun (1) - 1 freq |
uun (0) - 1 freq uon (1) - 1 freq un (1) - 31 freq yun (1) - 140 freq oun (1) - 14 freq uuno (1) - 1 freq an (2) - 77152 freq yuan (2) - 8 freq euan (2) - 3 freq ayn (2) - 3 freq yin (2) - 3094 freq ien (2) - 3 freq ein (2) - 86 freq une (2) - 4 freq ean (2) - 46 freq eon (2) - 3 freq uno (2) - 1 freq nu (2) - 10 freq aan (2) - 30 freq ioun (2) - 1 freq oan (2) - 6040 freq oon (2) - 2 freq nui (2) - 1 freq iin (2) - 2 freq yan (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 |
UUN |
| Time to execute Levenshtein function - 0.294970 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.603654 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.029383 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.086930 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.000902 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. |