Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
---|---|---|---|---|
wounded (0) - 11 freq sounded (1) - 25 freq rounded (1) - 7 freq pounded (1) - 2 freq hounded (1) - 1 freq founded (1) - 3 freq bounded (1) - 7 freq bouned (2) - 3 freq wonned (2) - 1 freq grunded (2) - 1 freq worned (2) - 1 freq foonded (2) - 1 freq worded (2) - 1 freq wound (2) - 29 freq woundin (2) - 1 freq counted (2) - 13 freq lounged (2) - 2 freq sounder (2) - 2 freq wounds (2) - 32 freq wended (2) - 1 freq haunded (2) - 19 freq woundit (2) - 17 freq moulded (2) - 2 freq mounted (2) - 8 freq poinded (2) - 1 freq |
wounded (0) - 11 freq bounded (2) - 7 freq wended (2) - 1 freq founded (2) - 3 freq winded (2) - 2 freq hounded (2) - 1 freq rounded (2) - 7 freq sounded (2) - 25 freq pounded (2) - 2 freq poinded (3) - 1 freq wonder (3) - 135 freq woundit (3) - 17 freq funded (3) - 13 freq haunded (3) - 19 freq bonded (3) - 3 freq windaed (3) - 1 freq wunted (3) - 3 freq wunder (3) - 26 freq soonded (3) - 23 freq roonded (3) - 13 freq woundin (3) - 1 freq foonded (3) - 1 freq wound (3) - 29 freq wounds (3) - 32 freq wonned (3) - 1 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 |
WOUNDED |
Time to execute Levenshtein function - 0.193761 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.380446 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.035396 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.036950 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.000861 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. |