| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| windaed (0) - 1 freq indaed (1) - 3 freq windae (1) - 537 freq winded (1) - 2 freq windae- (1) - 1 freq windaes (1) - 151 freq wandred (2) - 1 freq windered (2) - 27 freq windea (2) - 2 freq windie (2) - 4 freq intaed (2) - 1 freq windass (2) - 1 freq winder (2) - 112 freq winged (2) - 5 freq winced (2) - 2 freq windoes (2) - 1 freq winnae (2) - 46 freq 'indeed (2) - 4 freq winae (2) - 2 freq kindled (2) - 1 freq ingaed (2) - 5 freq windee (2) - 3 freq windes (2) - 1 freq windae's (2) - 5 freq winkled (2) - 1 freq |
windaed (0) - 1 freq winded (1) - 2 freq windaes (2) - 151 freq windae- (2) - 1 freq wended (2) - 1 freq indaed (2) - 3 freq windae (2) - 537 freq widdae (3) - 1 freq winda (3) - 47 freq wundae (3) - 14 freq winderd (3) - 1 freq winked (3) - 12 freq windeez (3) - 1 freq inded (3) - 1 freq indeed (3) - 178 freq windle (3) - 1 freq winted (3) - 40 freq minded (3) - 96 freq windze (3) - 1 freq wounded (3) - 11 freq wundaes (3) - 9 freq widded (3) - 1 freq windies (3) - 2 freq windier (3) - 1 freq wined (3) - 3 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 |
WINDAED |
| Time to execute Levenshtein function - 0.186019 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.369367 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.027208 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.037782 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.000779 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. |