| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| unrit (0) - 1 freq unfit (1) - 1 freq unit (1) - 42 freq unrest (2) - 6 freq harit (2) - 1 freq unyt (2) - 7 freq skrit (2) - 6 freq luntit (2) - 3 freq usit (2) - 4 freq unitit (2) - 29 freq endit (2) - 55 freq unity (2) - 45 freq fundit (2) - 19 freq uisit (2) - 7 freq intit (2) - 11 freq merit (2) - 17 freq bunnit (2) - 1 freq ungrip (2) - 1 freq antit (2) - 1 freq uncut (2) - 1 freq infit (2) - 1 freq brit (2) - 3 freq runrig (2) - 5 freq firit (2) - 1 freq marit (2) - 1 freq |
unrit (0) - 1 freq unit (2) - 42 freq unfit (2) - 1 freq nirt (3) - 1 freq untie (3) - 2 freq rit (3) - 13 freq norat (3) - 1 freq init (3) - 1 freq werit (3) - 1 freq crit (3) - 1 freq nait (3) - 1 freq unite (3) - 11 freq inert (3) - 3 freq innit (3) - 10 freq unt (3) - 1 freq unst (3) - 12 freq yunkit (3) - 1 freq ungat (3) - 1 freq warit (3) - 1 freq burit (3) - 1 freq ennit (3) - 2 freq onpit (3) - 1 freq nort (3) - 53 freq writ (3) - 51 freq grit (3) - 25 freq |
SoundEx code - U563 unnertowe - 2 freq unwritten - 6 freq unrade - 1 freq unnertaken - 1 freq unnertak - 4 freq unnerteuk - 1 freq unreadable - 2 freq unhertsome - 2 freq unnerratit - 2 freq unmortared - 1 freq unearthed - 7 freq unrationed - 1 freq unread - 3 freq unheard - 8 freq unhairtsome - 2 freq unnertone - 2 freq unorthodox - 1 freq unnerthreat - 1 freq unnerthe - 1 freq unnertakkins - 4 freq unnèr-docht - 43 freq unrit - 1 freq unnertuk - 7 freq unnertaakin - 1 freq unmerited - 1 freq unreddit - 1 freq unherd - 2 freq unruddered - 1 freq unnertakin - 1 freq unyirdlie - 1 freq unnertook - 1 freq unrowed - 2 freq unmerriet - 3 freq unmerried - 1 freq unnerwatter - 1 freq unnertaen - 3 freq unner-the-seat - 1 freq unnerdugs - 1 freq unearthly - 1 freq unhurt - 1 freq umrhdirk - 1 freq |
MetaPhone code - UNRT unrade - 1 freq unread - 3 freq unrit - 1 freq |
UNRIT |
| Time to execute Levenshtein function - 0.250635 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.447606 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.033981 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.044909 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.001077 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. |