Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
---|---|---|---|---|
unnerfit (0) - 5 freq underfit (1) - 1 freq unnerfuit (1) - 1 freq unneedit (2) - 1 freq unnerfelt (2) - 1 freq unnerpin (2) - 1 freq wunnerit (2) - 2 freq unmerkit (2) - 2 freq unnervin (2) - 1 freq unnerlie (2) - 1 freq unnerin (2) - 1 freq unnerside (3) - 1 freq undercut (3) - 1 freq unnerwey (3) - 1 freq unner-sie (3) - 2 freq wunnerin (3) - 83 freq unmerriet (3) - 3 freq unnertak (3) - 4 freq unmarkit (3) - 1 freq innerlie (3) - 7 freq untentit (3) - 1 freq wunnerfae (3) - 4 freq wunnerfu (3) - 57 freq junnerin (3) - 1 freq funnert (3) - 2 freq |
unnerfit (0) - 5 freq unnerfuit (1) - 1 freq underfit (2) - 1 freq unnerfelt (3) - 1 freq unnerin (4) - 1 freq underfoot (4) - 6 freq unnerlie (4) - 1 freq unnervin (4) - 1 freq unnerpin (4) - 1 freq wunnerit (4) - 2 freq unneedit (4) - 1 freq unmerkit (4) - 2 freq unnerfundit (5) - 1 freq unwarkit (5) - 1 freq unrit (5) - 1 freq unnerline (5) - 2 freq hunnert (5) - 14 freq unnerway (5) - 1 freq unbardit (5) - 1 freq unnerwent (5) - 1 freq unnerthe (5) - 1 freq insertit (5) - 2 freq unnercuts (5) - 1 freq unnerlay (5) - 1 freq wunnert (5) - 30 freq |
SoundEx code - U561 unraivel - 3 freq unnerfelt - 1 freq unripened - 1 freq unnerfit - 5 freq unrepentant - 1 freq unnerved - 2 freq unraivels - 1 freq unwrappit - 2 freq unwrap - 2 freq unreffel - 3 freq unravel - 1 freq unravelled - 1 freq unwrapped - 3 freq unraveller - 1 freq unnerves - 1 freq unnerpinnin - 3 freq unnerpinned - 4 freq unnerpin - 1 freq unnerpins - 2 freq unraivelled - 1 freq unraivelt - 2 freq unwrappt - 1 freq unroofed - 1 freq unravellin - 1 freq unner-pairts - 1 freq unnerfundin - 1 freq unnerfundit - 1 freq unnerfuit - 1 freq unnerwaffs - 1 freq unnerpass - 2 freq unnerpeyed - 1 freq unner-fed - 1 freq unner-appreciatit - 1 freq unnervin - 1 freq unrepresentative - 1 freq unnerrepresentit - 2 freq |
MetaPhone code - UNRFT unnerfit - 5 freq unnerved - 2 freq unroofed - 1 freq unnerfuit - 1 freq unner-fed - 1 freq |
UNNERFIT |
Time to execute Levenshtein function - 0.206917 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.345867 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.027649 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.037729 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.000992 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. |