| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| willingness (0) - 6 freq wullinness (2) - 1 freq unwillingness (2) - 2 freq wilsomeness (4) - 1 freq illness (4) - 24 freq willingdon (4) - 2 freq willingly (4) - 2 freq wilderness (4) - 14 freq killingeve (4) - 1 freq killings (4) - 2 freq jillings's (4) - 1 freq selliness (4) - 1 freq willie's (4) - 22 freq fillings (4) - 2 freq wildness (4) - 6 freq willing (4) - 10 freq jolliness (4) - 1 freq wickitness (4) - 4 freq jillings (4) - 10 freq nothingness (4) - 1 freq wileness (4) - 1 freq blindness (4) - 1 freq blinness (4) - 4 freq willies (4) - 6 freq wrangness (4) - 1 freq |
willingness (0) - 6 freq unwillingness (3) - 2 freq wullinness (3) - 1 freq wrangness (6) - 1 freq jillings (7) - 10 freq jolliness (7) - 1 freq willing (7) - 10 freq blindness (7) - 1 freq blinness (7) - 4 freq wildness (7) - 6 freq wileness (7) - 1 freq nothingness (7) - 1 freq fillings (7) - 2 freq willingly (7) - 2 freq willingdon (7) - 2 freq illness (7) - 24 freq wilsomeness (7) - 1 freq killings (7) - 2 freq wilderness (7) - 14 freq jillings's (7) - 1 freq selliness (7) - 1 freq hollowness (8) - 1 freq swellings (8) - 1 freq walings (8) - 2 freq youngness (8) - 1 freq |
SoundEx code - W452 willans - 1 freq william's - 2 freq williamson - 15 freq weelness' - 1 freq williams - 32 freq williams' - 3 freq willing - 10 freq willingdon - 2 freq weelness - 1 freq walawaying - 1 freq willingness - 6 freq wileness - 1 freq willingly - 2 freq wellington - 9 freq waulliam's - 1 freq walins - 2 freq weelins - 1 freq well-hung - 1 freq €˜wulness - 2 freq wulness - 1 freq wailing - 1 freq walings - 2 freq wullinness - 1 freq williamsbrewery - 2 freq whillans - 1 freq williamcrawley - 1 freq willmackie - 1 freq williamsonkev - 2 freq williemackenzie - 3 freq walunacrew - 2 freq |
MetaPhone code - WLNKNS willingness - 6 freq |
WILLINGNESS |
| Time to execute Levenshtein function - 0.214939 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.390506 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.029621 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.041430 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.000859 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. |