| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| wintit (0) - 111 freq hintit (1) - 2 freq dintit (1) - 3 freq mintit (1) - 28 freq jintit (1) - 1 freq wintir (1) - 8 freq windit (1) - 5 freq wiltit (1) - 1 freq tintit (1) - 3 freq intit (1) - 11 freq wantit (1) - 279 freq sintit (1) - 3 freq pintit (1) - 14 freq wingit (1) - 4 freq wintin (1) - 52 freq winkit (1) - 11 freq inti't (2) - 1 freq pitit (2) - 5 freq faintit (2) - 7 freq stintit (2) - 2 freq wirdit (2) - 1 freq winter (2) - 427 freq dentit (2) - 3 freq dintist (2) - 3 freq antit (2) - 1 freq |
wintit (0) - 111 freq wantit (1) - 279 freq wingit (2) - 4 freq sintit (2) - 3 freq wintin (2) - 52 freq waantit (2) - 22 freq wantet (2) - 82 freq winkit (2) - 11 freq intit (2) - 11 freq pintit (2) - 14 freq hintit (2) - 2 freq dintit (2) - 3 freq tintit (2) - 3 freq jintit (2) - 1 freq mintit (2) - 28 freq wintir (2) - 8 freq wiltit (2) - 1 freq windit (2) - 5 freq wastit (3) - 21 freq winted (3) - 40 freq duntit (3) - 25 freq pointit (3) - 23 freq winkt (3) - 2 freq pentit (3) - 44 freq mantit (3) - 2 freq |
SoundEx code - W533 wantit - 279 freq woundit - 17 freq wintit - 111 freq wanted - 261 freq wended - 1 freq 'wanted - 1 freq waantit - 22 freq wundit - 3 freq waanted - 19 freq winted - 40 freq windaed - 1 freq wounded - 11 freq wintet's - 1 freq windit - 5 freq wunted - 3 freq whanted - 4 freq wantet - 82 freq winded - 2 freq windae-dichter - 1 freq waantid - 2 freq woondit - 1 freq |
MetaPhone code - WNTT wantit - 279 freq woundit - 17 freq wintit - 111 freq wanted - 261 freq wended - 1 freq 'wanted - 1 freq waantit - 22 freq wundit - 3 freq waanted - 19 freq winted - 40 freq windaed - 1 freq wounded - 11 freq windit - 5 freq wunted - 3 freq whanted - 4 freq wantet - 82 freq winded - 2 freq waantid - 2 freq woondit - 1 freq |
WINTIT |
| Time to execute Levenshtein function - 0.272501 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.461242 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.030864 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.041757 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.000849 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. |