| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| unnerx (3) - 1 freq unnser (3) - 8 freq unnèr (3) - 27 freq unn (3) - 5 freq unner (3) - 454 freq unnder (3) - 1 freq unnér (3) - 5 freq hunnle (4) - 2 freq inna (4) - 19 freq snn (4) - 1 freq undae (4) - 3 freq unyt (4) - 7 freq bunnet (4) - 111 freq unduin (4) - 1 freq unendin (4) - 2 freq funnily (4) - 6 freq uner (4) - 2 freq un (4) - 31 freq tunnels (4) - 11 freq unum (4) - 1 freq uncrc (4) - 1 freq sunn (4) - 8 freq uneven (4) - 5 freq hunnér (4) - 3 freq unions (4) - 8 freq |
unnder (6) - 1 freq unnér (6) - 5 freq unner (6) - 454 freq unnerx (6) - 1 freq unnser (6) - 8 freq unnèr (6) - 27 freq unn (6) - 5 freq annoys (7) - 4 freq annaw (7) - 2 freq annum (7) - 2 freq anne (7) - 74 freq enna (7) - 11 freq annoy (7) - 12 freq ennit (7) - 2 freq innins (7) - 16 freq ennin (7) - 2 freq annies (7) - 1 freq onner (7) - 3 freq innin (7) - 34 freq enn's (7) - 1 freq annecb (7) - 2 freq annuff (7) - 1 freq inn (7) - 29 freq union' (7) - 1 freq annay (7) - 4 freq |
SoundEx code - U500 um - 142 freq uhm - 1 freq 'um - 27 freq uni - 51 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 - 51 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.177592 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.362055 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.027628 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.038281 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.000864 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. |