| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| unnser (3) - 8 freq unnder (3) - 1 freq unnerx (3) - 1 freq unnèr (3) - 27 freq unn (3) - 5 freq unnér (3) - 5 freq unner (3) - 461 freq gunnar (4) - 6 freq annan (4) - 4 freq unlik' (4) - 1 freq lnnj (4) - 1 freq enns (4) - 11 freq udny (4) - 9 freq hunnel (4) - 4 freq hunnér (4) - 3 freq onno't (4) - 1 freq unreal (4) - 10 freq hunnle (4) - 2 freq unhaps (4) - 1 freq innimy (4) - 1 freq dunnie (4) - 6 freq sunning (4) - 1 freq unknown (4) - 8 freq unable (4) - 19 freq annad (4) - 1 freq |
unnér (6) - 5 freq unnser (6) - 8 freq unn (6) - 5 freq unner (6) - 461 freq unnder (6) - 1 freq unnerx (6) - 1 freq unnèr (6) - 27 freq unions (7) - 8 freq anna's (7) - 3 freq ann's (7) - 4 freq annan' (7) - 1 freq union' (7) - 1 freq annone (7) - 1 freq inny (7) - 3 freq annals (7) - 5 freq annies (7) - 1 freq annjj (7) - 1 freq onnly (7) - 37 freq onnie (7) - 7 freq inn (7) - 29 freq onnay (7) - 1 freq annecb (7) - 2 freq onny (7) - 3 freq unean (7) - 1 freq onnir (7) - 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 |
UNN� |
| Time to execute Levenshtein function - 0.228795 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.401617 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.028006 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.038493 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.000962 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. |