| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| wudend (0) - 1 freq wund (2) - 104 freq widened (2) - 11 freq wunnd (2) - 1 freq wuiden (2) - 24 freq wend (2) - 1 freq wudna (2) - 9 freq wikend (2) - 10 freq suden (2) - 1 freq wumen (2) - 7 freq wudden (2) - 14 freq widen (2) - 13 freq juden (2) - 1 freq wkend (2) - 1 freq wyded (2) - 1 freq wident (2) - 2 freq waded (2) - 6 freq wudd (2) - 3 freq wudni (2) - 4 freq wadged (3) - 1 freq wuidn (3) - 1 freq dude's (3) - 1 freq sudan (3) - 1 freq ruders (3) - 1 freq whens (3) - 2 freq |
wudend (0) - 1 freq widened (2) - 11 freq wident (3) - 2 freq wyded (3) - 1 freq waded (3) - 6 freq wudni (3) - 4 freq widnad (3) - 1 freq widen (3) - 13 freq wudd (3) - 3 freq wkend (3) - 1 freq wudna (3) - 9 freq wend (3) - 1 freq wunnd (3) - 1 freq wund (3) - 104 freq wikend (3) - 10 freq wuiden (3) - 24 freq bydand (4) - 1 freq winnd (4) - 3 freq weeded (4) - 1 freq widid (4) - 2 freq wound (4) - 29 freq wiind (4) - 1 freq wudda (4) - 2 freq wedd (4) - 1 freq wuidna (4) - 25 freq |
SoundEx code - W353 widdie-wands - 1 freq widened - 11 freq waddin-day - 1 freq wudn't - 2 freq widn't - 1 freq wide-moothed - 1 freq white-wamed - 2 freq wittandlye - 1 freq wadn't - 1 freq white-eened - 1 freq wudend - 1 freq wident - 2 freq woodwinters - 2 freq woodwintersinv - 1 freq widnad - 1 freq |
MetaPhone code - WTNT widened - 11 freq waddin-day - 1 freq wudn't - 2 freq widn't - 1 freq wadn't - 1 freq white-eened - 1 freq wudend - 1 freq wident - 2 freq widnad - 1 freq |
WUDEND |
| Time to execute Levenshtein function - 0.190012 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.343664 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.028052 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.043082 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.000966 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. |