Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
---|---|---|---|---|
wended (0) - 1 freq bended (1) - 4 freq ended (1) - 72 freq tended (1) - 16 freq welded (1) - 1 freq mended (1) - 5 freq wedded (1) - 4 freq weeded (1) - 1 freq winded (1) - 2 freq weaved (2) - 2 freq pened (2) - 1 freq heeded (2) - 14 freq bedded (2) - 8 freq welled (2) - 1 freq winder (2) - 112 freq gender (2) - 19 freq kenned (2) - 33 freq dented (2) - 2 freq 'tended (2) - 1 freq landed (2) - 70 freq waned (2) - 6 freq leeded (2) - 1 freq needed (2) - 150 freq vanded (2) - 1 freq wyded (2) - 1 freq |
wended (0) - 1 freq winded (1) - 2 freq weeded (2) - 1 freq wedded (2) - 4 freq wounded (2) - 13 freq windaed (2) - 1 freq mended (2) - 5 freq bended (2) - 4 freq ended (2) - 72 freq welded (2) - 1 freq tended (2) - 16 freq endid (3) - 4 freq worded (3) - 1 freq bonded (3) - 3 freq handed (3) - 49 freq wadded (3) - 1 freq mynded (3) - 9 freq weened (3) - 1 freq wielded (3) - 2 freq winced (3) - 2 freq eynded (3) - 1 freq wanced (3) - 3 freq wunted (3) - 3 freq weenged (3) - 1 freq upended (3) - 1 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 |
WENDED |
Time to execute Levenshtein function - 0.604106 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 - 1.559312 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.031878 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.099613 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.001974 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. |