| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| uneo (0) - 1 freq undo (1) - 1 freq unco (1) - 328 freq une (1) - 4 freq uneco (1) - 2 freq unyo (1) - 1 freq neo (1) - 1 freq uner (1) - 2 freq uno (1) - 1 freq unto (1) - 8 freq no (2) - 10287 freq unsee (2) - 1 freq nea (2) - 1 freq sune (2) - 82 freq nem (2) - 53 freq unis (2) - 2 freq punto (2) - 4 freq rnez (2) - 1 freq uydo (2) - 1 freq uo (2) - 4 freq fnek (2) - 1 freq un (2) - 31 freq mungo (2) - 7 freq unce (2) - 7 freq useco (2) - 1 freq |
uneo (0) - 1 freq uno (1) - 1 freq unyo (1) - 1 freq neo (1) - 1 freq une (1) - 4 freq noo (2) - 5800 freq onee (2) - 2 freq ane (2) - 2140 freq nee (2) - 14 freq anee (2) - 1 freq enoo (2) - 8 freq nuo (2) - 1 freq ine (2) - 3 freq ene (2) - 40 freq uuno (2) - 1 freq ino (2) - 2 freq ono (2) - 3 freq ne (2) - 86 freq uni (2) - 53 freq nyo (2) - 1 freq inoo (2) - 10 freq ney (2) - 5 freq eno (2) - 9 freq one (2) - 766 freq anoo (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 |
UNEO |
| Time to execute Levenshtein function - 0.222650 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.358817 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.029387 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.039142 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.000911 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. |