| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| unn (0) - 5 freq ann (1) - 105 freq une (1) - 4 freq upn (1) - 1 freq uzn (1) - 1 freq unt (1) - 1 freq und (1) - 12 freq un (1) - 31 freq snn (1) - 1 freq uon (1) - 1 freq uun (1) - 1 freq uni (1) - 53 freq gunn (1) - 2 freq funn (1) - 25 freq inn (1) - 29 freq ung (1) - 1 freq uno (1) - 1 freq dunn (1) - 8 freq enn (1) - 38 freq cnn (1) - 1 freq wunn (1) - 9 freq urn (1) - 6 freq sunn (1) - 8 freq bunn (1) - 1 freq unk (1) - 1 freq |
unn (0) - 5 freq ann (1) - 105 freq nn (1) - 2 freq enn (1) - 38 freq inn (1) - 29 freq nan (2) - 14 freq anne (2) - 77 freq nne (2) - 1 freq nuin (2) - 14 freq enna (2) - 11 freq onno (2) - 20 freq unean (2) - 1 freq inny (2) - 3 freq union (2) - 192 freq enin (2) - 4 freq inno (2) - 197 freq anna (2) - 18 freq nen (2) - 6 freq anny (2) - 1 freq nin (2) - 1 freq onny (2) - 3 freq onna (2) - 18 freq anno (2) - 5 freq anen (2) - 49 freq inna (2) - 19 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 |
UNN |
| Time to execute Levenshtein function - 0.204436 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.339872 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.028278 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.048867 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.001148 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. |