| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| wailing (0) - 1 freq railing (1) - 6 freq nailing (1) - 3 freq sailing (1) - 6 freq mailing (1) - 3 freq wailin (1) - 11 freq wailin' (1) - 2 freq failing (1) - 2 freq waiting (1) - 48 freq warbling (2) - 1 freq wanting (2) - 18 freq weakling (2) - 1 freq ailin (2) - 2 freq wesling (2) - 1 freq warning (2) - 11 freq tailin (2) - 1 freq raiding (2) - 1 freq dailins (2) - 4 freq baling (2) - 1 freq dailin (2) - 1 freq cairling (2) - 1 freq railins (2) - 22 freq mailins (2) - 1 freq wailit (2) - 1 freq wadding (2) - 1 freq |
wailing (0) - 1 freq wailin' (2) - 2 freq failing (2) - 2 freq wailin (2) - 11 freq waiting (2) - 48 freq railing (2) - 6 freq mailing (2) - 3 freq nailing (2) - 3 freq sailing (2) - 6 freq waaking (3) - 1 freq awaiting (3) - 2 freq wilin (3) - 1 freq wiring (3) - 2 freq filing (3) - 1 freq waalin (3) - 1 freq walking (3) - 53 freq toiling (3) - 2 freq walings (3) - 2 freq ceiling (3) - 11 freq waving (3) - 8 freq wiping (3) - 3 freq boiling (3) - 2 freq waxing (3) - 1 freq wading (3) - 1 freq aisling (3) - 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 - WLNK willing - 10 freq wailing - 1 freq |
WAILING |
| Time to execute Levenshtein function - 0.274160 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.394552 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.027436 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.037043 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.000828 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. |