| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| unitit (0) - 29 freq unitet (1) - 3 freq unitin (1) - 2 freq suitit (2) - 8 freq whitit (2) - 1 freq unrit (2) - 1 freq muntit (2) - 3 freq intit (2) - 11 freq unit (2) - 41 freq unity (2) - 45 freq until (2) - 477 freq runtit (2) - 3 freq snirtit (2) - 2 freq pitit (2) - 5 freq doitit (2) - 13 freq uinitie (2) - 1 freq invitit (2) - 39 freq luntit (2) - 3 freq units (2) - 21 freq reunitit (2) - 1 freq duntit (2) - 25 freq smitit (2) - 1 freq uisit (2) - 7 freq antit (2) - 1 freq huntit (2) - 29 freq |
unitit (0) - 29 freq unitet (1) - 3 freq notit (2) - 12 freq uneytit (2) - 1 freq intit (2) - 11 freq antit (2) - 1 freq unitin (2) - 2 freq ignitit (3) - 1 freq unites (3) - 4 freq unite (3) - 11 freq ruitit (3) - 7 freq maitit (3) - 1 freq united (3) - 75 freq leitit (3) - 3 freq editit (3) - 6 freq saitit (3) - 2 freq nutt (3) - 2 freq nott (3) - 55 freq entity (3) - 17 freq nitty (3) - 1 freq evitit (3) - 2 freq unfit (3) - 1 freq haitit (3) - 1 freq waitit (3) - 79 freq ditit (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 |
UNITIT |
| Time to execute Levenshtein function - 0.207065 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.557587 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.027884 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.067036 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.000850 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. |