| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| wantit (0) - 279 freq antit (1) - 1 freq waitit (1) - 79 freq wautit (1) - 1 freq wanwit (1) - 1 freq waftit (1) - 4 freq wantin (1) - 321 freq wantet (1) - 82 freq cantit (1) - 1 freq santit (1) - 2 freq wastit (1) - 21 freq wintit (1) - 111 freq mantit (1) - 2 freq wanlit (1) - 4 freq gantit (1) - 10 freq wanit (1) - 1 freq pantit (1) - 2 freq lantit (1) - 1 freq rantit (1) - 1 freq hantit (1) - 3 freq waantit (1) - 22 freq rentit (2) - 6 freq faintit (2) - 7 freq wallit (2) - 1 freq pentit (2) - 44 freq |
wantit (0) - 279 freq wantet (1) - 82 freq waantit (1) - 22 freq wintit (1) - 111 freq gantit (2) - 10 freq mantit (2) - 2 freq wanlit (2) - 4 freq pantit (2) - 2 freq hantit (2) - 3 freq lantit (2) - 1 freq wanit (2) - 1 freq rantit (2) - 1 freq wautit (2) - 1 freq wastit (2) - 21 freq antit (2) - 1 freq wanwit (2) - 1 freq waitit (2) - 79 freq waftit (2) - 4 freq cantit (2) - 1 freq santit (2) - 2 freq wantin (2) - 321 freq wanten (3) - 1 freq winkit (3) - 11 freq dintit (3) - 3 freq mintit (3) - 28 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 |
WANTIT want - 1616 freq wanted - 261 freq wantit - 279 freq wants - 285 freq wanting - 18 freq wantin - 321 freq |
| Time to execute Levenshtein function - 0.200948 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.338052 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.026824 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.036982 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.000825 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. |