Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
---|---|---|---|---|
unrepentant (0) - 1 freq repentant (2) - 3 freq unrelentin (3) - 3 freq independant (3) - 1 freq unrelenting (3) - 1 freq repentin (4) - 1 freq repeatan (4) - 3 freq independent (4) - 89 freq unimportant (4) - 18 freq repentit (4) - 6 freq repentance (4) - 3 freq unremittin (5) - 1 freq untentit (5) - 1 freq unbekent (5) - 7 freq repintance (5) - 1 freq greenland (5) - 16 freq repents (5) - 2 freq surprenant (5) - 1 freq threetent (5) - 2 freq unkennt (5) - 3 freq repeatin' (5) - 1 freq intendant (5) - 1 freq irrelevant (5) - 5 freq repintit (5) - 1 freq representan (5) - 2 freq |
unrepentant (0) - 1 freq repentant (3) - 3 freq unrelenting (5) - 1 freq independant (5) - 1 freq unrelentin (5) - 3 freq repentit (6) - 6 freq repentance (6) - 3 freq unimportant (6) - 18 freq repentin (6) - 1 freq independent (6) - 89 freq serpentine (7) - 4 freq repintit (7) - 1 freq animportant (7) - 1 freq repintance (7) - 1 freq forementiont (7) - 1 freq repeatan (7) - 3 freq turpentine (7) - 3 freq unlamentit (8) - 1 freq presentin (8) - 5 freq protestant (8) - 28 freq redundant (8) - 5 freq repetit (8) - 1 freq repeating (8) - 2 freq unrelatit (8) - 2 freq unpleasant (8) - 4 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 - UNRPNTNT unrepentant - 1 freq |
UNREPENTANT |
Time to execute Levenshtein function - 0.240775 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.441289 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.037855 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.038971 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.000904 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. |