| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| wanst (0) - 32 freq wannt (1) - 1 freq wanit (1) - 1 freq waist (1) - 45 freq wans' (1) - 1 freq canst (1) - 2 freq wans (1) - 175 freq warst (1) - 72 freq wast (1) - 139 freq want (1) - 1648 freq wurst (2) - 11 freq wass (2) - 8 freq wadset (2) - 6 freq wantit (2) - 280 freq warsh (2) - 1 freq waas (2) - 155 freq fant (2) - 2 freq sans (2) - 7 freq wanae (2) - 1 freq wanny (2) - 8 freq wist (2) - 3 freq ways (2) - 51 freq warkt (2) - 11 freq gant (2) - 15 freq paist (2) - 1 freq |
wanst (0) - 32 freq wans (2) - 175 freq wast (2) - 139 freq want (2) - 1648 freq canst (2) - 2 freq warst (2) - 72 freq wans' (2) - 1 freq wanit (2) - 1 freq wannt (2) - 1 freq waist (2) - 45 freq waste (3) - 119 freq wneist (3) - 1 freq wanes (3) - 2 freq naist (3) - 7 freq wanwit (3) - 1 freq wains (3) - 13 freq wansce (3) - 1 freq wantet (3) - 82 freq weans' (3) - 10 freq wisst (3) - 5 freq weant (3) - 1 freq waant (3) - 93 freq weest (3) - 1 freq winsy (3) - 1 freq wont (3) - 31 freq |
SoundEx code - W523 wanst - 32 freq whanged - 1 freq wheenged - 1 freq winked - 12 freq winkt - 2 freq wneist - 1 freq wingit - 4 freq wine-stained - 1 freq wanced - 3 freq winged - 5 freq weinstein - 1 freq winkit - 11 freq winston - 3 freq wame-stappin - 1 freq 'winston - 1 freq winceyette - 1 freq wan-sided - 2 freq weenstip - 1 freq whingit - 1 freq winched - 4 freq weenged - 1 freq wansdays - 1 freq wainscots - 1 freq winced - 2 freq wanc't - 1 freq wance't - 3 freq wingsscotland - 4 freq wnkdqi - 1 freq whingytoddlers - 1 freq |
MetaPhone code - WNST wanst - 32 freq wanced - 3 freq winced - 2 freq wance't - 3 freq |
WANST |
| Time to execute Levenshtein function - 0.212785 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.354579 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.032281 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.043699 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.001133 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. |