| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| waantit (0) - 22 freq waantin (1) - 38 freq waantid (1) - 2 freq wantit (1) - 279 freq haantit (1) - 1 freq saantit (1) - 1 freq cantit (2) - 1 freq rantit (2) - 1 freq santit (2) - 2 freq wastit (2) - 21 freq waabit (2) - 2 freq wantet (2) - 82 freq waistit (2) - 4 freq waant (2) - 93 freq paintit (2) - 22 freq wahntin (2) - 1 freq tauntit (2) - 2 freq chantit (2) - 8 freq wautit (2) - 1 freq maantie (2) - 2 freq aantie (2) - 2 freq faintit (2) - 7 freq waants (2) - 30 freq sauntit (2) - 9 freq waitit (2) - 79 freq |
waantit (0) - 22 freq wantit (1) - 279 freq wintit (2) - 111 freq wantet (2) - 82 freq saantit (2) - 1 freq haantit (2) - 1 freq waantin (2) - 38 freq waantid (2) - 2 freq dauntit (3) - 3 freq gantit (3) - 10 freq hauntit (3) - 15 freq wantin (3) - 321 freq waftit (3) - 4 freq waantan (3) - 14 freq pantit (3) - 2 freq waanert (3) - 1 freq antit (3) - 1 freq taintit (3) - 1 freq waanted (3) - 19 freq mantit (3) - 2 freq wanwit (3) - 1 freq hantit (3) - 3 freq wauntin (3) - 2 freq wanit (3) - 1 freq lantit (3) - 1 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 |
WAANTIT |
| Time to execute Levenshtein function - 0.557242 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.732274 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.078967 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.087925 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.000808 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. |