Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
---|---|---|---|---|
winted (0) - 41 freq winged (1) - 5 freq wunted (1) - 3 freq wanted (1) - 265 freq wined (1) - 4 freq winced (1) - 2 freq pinted (1) - 16 freq minted (1) - 10 freq tinted (1) - 2 freq hinted (1) - 2 freq winked (1) - 12 freq winded (1) - 2 freq winter (1) - 434 freq windea (2) - 2 freq lifted (2) - 99 freq winces (2) - 3 freq painted (2) - 40 freq whanted (2) - 4 freq wince (2) - 5 freq windee (2) - 3 freq dinged (2) - 18 freq misted (2) - 2 freq tilted (2) - 5 freq winnen (2) - 1 freq tinged (2) - 4 freq |
winted (0) - 41 freq wunted (1) - 3 freq wanted (1) - 265 freq winded (2) - 2 freq winked (2) - 12 freq winter (2) - 434 freq waanted (2) - 19 freq hinted (2) - 2 freq winged (2) - 5 freq wanteed (2) - 1 freq tinted (2) - 2 freq wined (2) - 4 freq winced (2) - 2 freq minted (2) - 10 freq pinted (2) - 16 freq fainted (3) - 5 freq tainted (3) - 3 freq wonned (3) - 1 freq rented (3) - 5 freq wasted (3) - 24 freq intead (3) - 2 freq pented (3) - 4 freq wintit (3) - 111 freq manted (3) - 1 freq hanted (3) - 2 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 |
WINTED |
Time to execute Levenshtein function - 0.302451 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.535496 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.086458 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.090673 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.000933 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. |