Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
---|---|---|---|---|
wlsqqraasf (0) - 1 freq straas (5) - 1 freq wastrals (5) - 1 freq sparras (6) - 7 freq flora's (6) - 1 freq strahs (6) - 1 freq liberals (6) - 5 freq squash (6) - 5 freq ultras (6) - 2 freq bluegrass (6) - 1 freq whyt-waash (6) - 2 freq whitemaas (6) - 1 freq vlvrsf (6) - 1 freq waas' (6) - 2 freq whitrats (6) - 1 freq tsipras (6) - 1 freq laas (6) - 12 freq miscaas (6) - 1 freq spraff (6) - 3 freq sorraes (6) - 3 freq lsfsvas (6) - 1 freq wearamask (6) - 1 freq shadaas (6) - 2 freq scrans (6) - 3 freq straws (6) - 6 freq |
wlsqqraasf (0) - 1 freq wiskers (10) - 1 freq wasters (10) - 6 freq vlvrsf (10) - 1 freq washers (10) - 1 freq ulsters (10) - 1 freq wastries (10) - 1 freq straas (10) - 1 freq wastrals (10) - 1 freq squars (10) - 1 freq sqtrf (10) - 1 freq straes (11) - 3 freq squares (11) - 17 freq falsers (11) - 18 freq whisperers (11) - 1 freq glossaries (11) - 4 freq alsatians (11) - 2 freq dalserf (11) - 1 freq dispraise (11) - 3 freq whauras (11) - 5 freq wilson's (11) - 2 freq westerns (11) - 1 freq allstars (11) - 1 freq strafef (11) - 1 freq west-coast (11) - 4 freq |
SoundEx code - W426 walker - 25 freq weel-wishers - 3 freq weel-wushers - 1 freq wheelchair - 14 freq walker's - 5 freq waalker's - 2 freq walkers - 18 freq walkers' - 1 freq weel-creeshed - 1 freq weel-cared - 1 freq wheelcheer - 4 freq weill-cordit - 1 freq willsher - 1 freq weill-graithit - 1 freq weel-groomed - 1 freq wheelchairs - 1 freq wheelchyre - 3 freq weel-grundit - 1 freq walkcork - 1 freq wlsqqraasf - 1 freq wilshire - 2 freq walkers - 1 freq |
MetaPhone code - LSKRSF wlsqqraasf - 1 freq |
WLSQQRAASF |
Time to execute Levenshtein function - 0.247486 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.437591 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.027471 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.037427 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.000878 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. |