Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
---|---|---|---|---|
wanted (0) - 265 freq hanted (1) - 2 freq wanced (1) - 3 freq wantet (1) - 82 freq ganted (1) - 2 freq wafted (1) - 7 freq 'wanted (1) - 1 freq walted (1) - 1 freq wasted (1) - 24 freq waanted (1) - 19 freq ranted (1) - 4 freq whanted (1) - 4 freq winted (1) - 41 freq waited (1) - 109 freq wated (1) - 1 freq waned (1) - 6 freq wanteed (1) - 1 freq wunted (1) - 3 freq manted (1) - 1 freq panted (1) - 5 freq wanten (1) - 1 freq farted (2) - 3 freq patted (2) - 15 freq parted (2) - 1 freq wand (2) - 14 freq |
wanted (0) - 265 freq winted (1) - 41 freq wunted (1) - 3 freq waanted (1) - 19 freq wanteed (1) - 1 freq wafted (2) - 7 freq wanced (2) - 3 freq waned (2) - 6 freq panted (2) - 5 freq wanten (2) - 1 freq hanted (2) - 2 freq waantid (2) - 2 freq wated (2) - 1 freq manted (2) - 1 freq walted (2) - 1 freq waited (2) - 109 freq 'wanted (2) - 1 freq ganted (2) - 2 freq wasted (2) - 24 freq wantet (2) - 82 freq ranted (2) - 4 freq whanted (2) - 4 freq unwanted (3) - 6 freq wantae (3) - 15 freq wants (3) - 295 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 |
WANTED want - 1648 freq wanted - 265 freq wantit - 280 freq wants - 295 freq wanting - 19 freq wantin - 326 freq |
Time to execute Levenshtein function - 0.201274 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.349850 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.027250 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.036972 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.000906 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. |