| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| woondit (0) - 1 freq soondit (1) - 61 freq woundit (1) - 17 freq hoondit (1) - 1 freq roondit (1) - 13 freq foondit (1) - 41 freq boordit (2) - 2 freq roundit (2) - 3 freq boondin (2) - 1 freq foondin (2) - 13 freq foondet (2) - 1 freq doonsit (2) - 1 freq coontit (2) - 30 freq soondin (2) - 47 freq woundin (2) - 1 freq stoondit (2) - 2 freq groondit (2) - 2 freq hoondin (2) - 1 freq foundit (2) - 6 freq woont (2) - 1 freq soonit (2) - 1 freq woodie (2) - 1 freq moonlit (2) - 4 freq bondit (2) - 1 freq hoodit (2) - 1 freq |
woondit (0) - 1 freq woundit (1) - 17 freq soondit (2) - 61 freq wundit (2) - 3 freq foondit (2) - 41 freq windit (2) - 5 freq roondit (2) - 13 freq hoondit (2) - 1 freq woont (3) - 1 freq foundit (3) - 6 freq bondit (3) - 1 freq woond (3) - 5 freq woundin (3) - 1 freq soundit (3) - 29 freq boundit (3) - 1 freq foondet (3) - 1 freq roundit (3) - 3 freq wyndin (4) - 2 freq wadit (4) - 1 freq wirdit (4) - 1 freq wuidit (4) - 1 freq aboundit (4) - 1 freq wondert (4) - 10 freq waandir (4) - 1 freq ownit (4) - 8 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 |
WOONDIT |
| Time to execute Levenshtein function - 0.211473 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.408519 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.027335 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.039837 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.000969 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. |