| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| willing (0) - 10 freq tilling (1) - 1 freq pilling (1) - 1 freq killing (1) - 7 freq filling (1) - 5 freq milling (1) - 1 freq willint (1) - 5 freq willin (1) - 58 freq willin' (1) - 2 freq wiring (2) - 2 freq unwilling (2) - 1 freq yelling (2) - 1 freq killin (2) - 61 freq wirking (2) - 4 freq grilling (2) - 1 freq wilin (2) - 1 freq pulling (2) - 11 freq selling (2) - 10 freq willna (2) - 25 freq telling (2) - 78 freq twirling (2) - 1 freq wiping (2) - 3 freq swirling (2) - 2 freq spilling (2) - 3 freq winning (2) - 13 freq |
willing (0) - 10 freq willint (2) - 5 freq willin' (2) - 2 freq milling (2) - 1 freq willin (2) - 58 freq tilling (2) - 1 freq filling (2) - 5 freq pilling (2) - 1 freq killing (2) - 7 freq willni (3) - 2 freq wailing (3) - 1 freq willno (3) - 1 freq willingly (3) - 2 freq polling (3) - 3 freq willan (3) - 5 freq dwelling (3) - 2 freq willans (3) - 1 freq culling (3) - 2 freq wesling (3) - 1 freq willinly (3) - 2 freq walking (3) - 53 freq welding (3) - 2 freq wullin (3) - 23 freq wullint (3) - 1 freq willen (3) - 4 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 - WLNK willing - 10 freq wailing - 1 freq |
WILLING |
| Time to execute Levenshtein function - 0.207710 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.408201 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.027128 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.043746 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.000991 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. |