| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| untied (0) - 7 freq ontied (1) - 1 freq untie (1) - 2 freq untried (1) - 1 freq andied (2) - 1 freq united (2) - 75 freq tied (2) - 119 freq untrod (2) - 1 freq pitied (2) - 3 freq punted (2) - 5 freq undies (2) - 3 freq antiek (2) - 1 freq stied (2) - 2 freq intaed (2) - 1 freq untee (2) - 1 freq suntie (2) - 6 freq untitled (2) - 1 freq dunted (2) - 6 freq unified (2) - 3 freq auntie (2) - 157 freq hunted (2) - 11 freq unwind (2) - 5 freq jundied (2) - 4 freq unused (2) - 2 freq envied (2) - 3 freq |
untied (0) - 7 freq ontied (1) - 1 freq united (2) - 75 freq intaed (2) - 1 freq untried (2) - 1 freq untie (2) - 2 freq untidy (2) - 1 freq invied (3) - 1 freq unsaed (3) - 1 freq unwed (3) - 1 freq unter (3) - 1 freq notid (3) - 1 freq until (3) - 477 freq untae (3) - 13 freq untold (3) - 1 freq nied (3) - 3 freq noted (3) - 23 freq intead (3) - 2 freq enticed (3) - 2 freq untamed (3) - 1 freq envied (3) - 3 freq wunted (3) - 3 freq aunties (3) - 16 freq inated (3) - 1 freq antiek (3) - 1 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 - UNTT united - 75 freq untied - 7 freq undeid - 3 freq untidy - 1 freq unitet - 3 freq unneedit - 1 freq unitit - 29 freq uneytit - 1 freq 'united - 1 freq |
UNTIED |
| Time to execute Levenshtein function - 0.225340 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.369721 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.028306 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.037796 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.000823 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. |