| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| undeterred (0) - 7 freq deterred (2) - 3 freq undettered (2) - 1 freq unreserved (3) - 1 freq unfettered (3) - 2 freq undefeated (3) - 1 freq deserred (3) - 2 freq sneestered (4) - 1 freq unattended (4) - 1 freq dytered (4) - 1 freq fleetered (4) - 1 freq indentured (4) - 1 freq unobserved (4) - 1 freq flietered (4) - 1 freq undelivered (4) - 1 freq petered (4) - 3 freq underlined (4) - 2 freq sterred (4) - 1 freq undergrad (4) - 1 freq undermined (4) - 1 freq unperturbed (4) - 1 freq underrated (4) - 2 freq underpeyed (4) - 1 freq reteired (4) - 3 freq unmerried (4) - 1 freq |
undeterred (0) - 7 freq undettered (3) - 1 freq deterred (3) - 3 freq unfettered (5) - 2 freq deserred (5) - 2 freq undergrad (6) - 1 freq sterred (6) - 1 freq detoured (6) - 2 freq nattered (6) - 1 freq nettered (6) - 2 freq untried (6) - 1 freq underpeyed (6) - 1 freq underrated (6) - 2 freq unmerried (6) - 1 freq naitered (6) - 1 freq undisturbed (6) - 3 freq undefeated (6) - 1 freq unreserved (6) - 1 freq undelivered (6) - 1 freq dytered (6) - 1 freq entered (6) - 39 freq unturned (6) - 3 freq indentured (6) - 1 freq wundered (7) - 1 freq underside (7) - 2 freq |
SoundEx code - U533 united - 75 freq unheedit - 1 freq undootadly - 1 freq untied - 7 freq undeid - 3 freq undeterred - 7 freq untitled - 1 freq untidy - 1 freq unitet - 3 freq undettered - 1 freq unneedit - 1 freq unitit - 29 freq unteddert - 1 freq undootedly - 2 freq united's - 1 freq uneytit - 1 freq unheeded - 1 freq unitedprotestan - 1 freq 'united - 1 freq unitedrewind - 1 freq |
MetaPhone code - UNTTRT undeterred - 7 freq undettered - 1 freq unteddert - 1 freq |
UNDETERRED |
| Time to execute Levenshtein function - 0.204510 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.384705 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.027918 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.045427 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.004504 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. |