| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| uon (0) - 1 freq non (1) - 39 freq jon (1) - 4 freq upn (1) - 1 freq buon (1) - 1 freq un (1) - 31 freq uoa (1) - 1 freq con (1) - 21 freq ron (1) - 14 freq uun (1) - 1 freq upon (1) - 255 freq uo (1) - 4 freq eon (1) - 3 freq pon (1) - 3 freq von (1) - 1 freq fon (1) - 3 freq uok (1) - 1 freq hon (1) - 11 freq 'on (1) - 22 freq ion (1) - 1 freq don (1) - 260 freq mon (1) - 149 freq son (1) - 532 freq aon (1) - 4 freq on (1) - 18872 freq |
uon (0) - 1 freq yon (1) - 1565 freq ion (1) - 1 freq oon (1) - 2 freq on (1) - 18872 freq aon (1) - 4 freq uun (1) - 1 freq eon (1) - 3 freq un (1) - 31 freq yun (2) - 140 freq ooin (2) - 1 freq aen (2) - 10 freq yona (2) - 12 freq yuan (2) - 8 freq ean (2) - 46 freq uuno (2) - 1 freq yone (2) - 7 freq nuo (2) - 1 freq yn (2) - 6 freq one (2) - 766 freq noo (2) - 5800 freq ony (2) - 2222 freq yan (2) - 1 freq ayn (2) - 3 freq ian (2) - 202 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 |
UON |
| Time to execute Levenshtein function - 0.219896 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.505544 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.074453 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.090315 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.000871 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. |