| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| windit (0) - 5 freq windi (1) - 2 freq mindit (1) - 163 freq windie (1) - 4 freq wingit (1) - 4 freq winkit (1) - 11 freq wirdit (1) - 1 freq windin (1) - 28 freq hindit (1) - 1 freq wintit (1) - 111 freq wundit (1) - 3 freq widit (1) - 1 freq widdit (1) - 2 freq windis (1) - 2 freq wibit (2) - 1 freq woundit (2) - 17 freq randit (2) - 1 freq winds (2) - 61 freq woondit (2) - 1 freq endit (2) - 55 freq widid (2) - 2 freq landit (2) - 52 freq winding (2) - 2 freq windy (2) - 36 freq winkt (2) - 2 freq |
windit (0) - 5 freq wundit (1) - 3 freq widdit (2) - 2 freq mindit (2) - 163 freq windis (2) - 2 freq woundit (2) - 17 freq windi (2) - 2 freq woondit (2) - 1 freq wintit (2) - 111 freq widit (2) - 1 freq wingit (2) - 4 freq windie (2) - 4 freq wirdit (2) - 1 freq winkit (2) - 11 freq windin (2) - 28 freq hindit (2) - 1 freq fendit (3) - 11 freq wundie (3) - 1 freq weedit (3) - 1 freq eyndit (3) - 2 freq wint (3) - 629 freq windoo (3) - 1 freq fundit (3) - 19 freq winda (3) - 47 freq wind' (3) - 1 freq |
SoundEx code - W533 wantit - 280 freq woundit - 17 freq wintit - 111 freq wanted - 265 freq wended - 1 freq 'wanted - 1 freq waantit - 22 freq wundit - 3 freq waanted - 19 freq winted - 41 freq windaed - 1 freq wounded - 13 freq wintet's - 1 freq windit - 5 freq wunted - 3 freq wanteed - 1 freq whanted - 4 freq wantet - 82 freq winded - 2 freq windae-dichter - 1 freq waantid - 2 freq woondit - 1 freq |
MetaPhone code - WNTT wantit - 280 freq woundit - 17 freq wintit - 111 freq wanted - 265 freq wended - 1 freq 'wanted - 1 freq waantit - 22 freq wundit - 3 freq waanted - 19 freq winted - 41 freq windaed - 1 freq wounded - 13 freq windit - 5 freq wunted - 3 freq wanteed - 1 freq whanted - 4 freq wantet - 82 freq winded - 2 freq waantid - 2 freq woondit - 1 freq |
WINDIT |
| Time to execute Levenshtein function - 0.196516 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.362447 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.027777 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.038581 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.000882 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. |