| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| unwillingness (0) - 2 freq willingness (2) - 6 freq unweillness (4) - 1 freq unwilling (4) - 1 freq wullinness (4) - 1 freq unwillin (5) - 7 freq unweelness (5) - 1 freq naethingness (5) - 1 freq unwillint (5) - 1 freq nothingness (5) - 1 freq willie's (6) - 22 freq uncanniness (6) - 1 freq willingdon (6) - 2 freq naethinness (6) - 2 freq phillipines (6) - 2 freq wilderness (6) - 14 freq €˜wildness (6) - 1 freq jolliness (6) - 1 freq willingly (6) - 2 freq jillings (6) - 10 freq ugliness (6) - 1 freq wickitness (6) - 4 freq inglisness (6) - 1 freq unrelentless (6) - 1 freq selliness (6) - 1 freq |
unwillingness (0) - 2 freq willingness (3) - 6 freq wullinness (6) - 1 freq unweillness (6) - 1 freq unwilling (7) - 1 freq nothingness (8) - 1 freq naethingness (8) - 1 freq unweelness (8) - 1 freq swellings (9) - 1 freq dwellings (9) - 1 freq unwillint (9) - 1 freq wrangness (9) - 1 freq unwillin (9) - 7 freq jillings's (10) - 1 freq blinness (10) - 4 freq illness (10) - 24 freq fillings (10) - 2 freq wileness (10) - 1 freq wilsomeness (10) - 1 freq englishness (10) - 2 freq unpleasantness (10) - 1 freq stillness (10) - 9 freq wildness (10) - 6 freq willing (10) - 10 freq blindness (10) - 1 freq |
SoundEx code - U545 unweelness - 1 freq 'unweelness' - 1 freq unwillint - 1 freq unalane - 1 freq unwillingness - 2 freq unlimited - 21 freq unwillin - 7 freq unlandit - 1 freq unweillness - 1 freq unlamentit - 1 freq unwullant - 1 freq unlamentin - 1 freq unwilling - 1 freq |
MetaPhone code - UNWLNKNS unwillingness - 2 freq |
UNWILLINGNESS |
| Time to execute Levenshtein function - 0.389383 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.691931 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.027383 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.105423 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.000880 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. |