| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| weasley (0) - 2 freq weasely (2) - 1 freq easles (2) - 2 freq measles (2) - 5 freq wasney (2) - 1 freq weakly (2) - 6 freq lesley (2) - 18 freq worsley (2) - 1 freq weasel (2) - 3 freq weesles (2) - 1 freq peasey (2) - 1 freq wembley (2) - 1 freq easle (2) - 2 freq waley (2) - 6 freq breasley (2) - 1 freq measly (2) - 1 freq wearier (3) - 1 freq wellen (3) - 1 freq cease (3) - 10 freq kellsley (3) - 3 freq seaseek (3) - 1 freq whase (3) - 142 freq weegle (3) - 1 freq whaler (3) - 1 freq 'alley (3) - 2 freq |
weasley (0) - 2 freq weasel (2) - 3 freq weasely (2) - 1 freq weesles (3) - 1 freq measly (3) - 1 freq worsley (3) - 1 freq waley (3) - 6 freq easle (3) - 2 freq lesley (3) - 18 freq wasney (3) - 1 freq weakly (3) - 6 freq westy (4) - 6 freq wally (4) - 48 freq wiley (4) - 1 freq weal (4) - 8 freq weebly (4) - 1 freq wastel (4) - 1 freq weliy (4) - 1 freq weigle (4) - 1 freq isley (4) - 1 freq deisle (4) - 1 freq whiley (4) - 12 freq easily (4) - 60 freq welly (4) - 5 freq easely (4) - 1 freq |
SoundEx code - W240 weekly - 25 freq wisely - 8 freq waikly - 3 freq wycely - 2 freq wiggly - 3 freq whussle - 3 freq weakly - 6 freq weasley - 2 freq weegle - 1 freq wauchle - 4 freq weasel - 3 freq wachle - 1 freq wigly - 1 freq weechil - 2 freq wechle - 1 freq waxweel - 1 freq weechile - 1 freq wicely - 2 freq whussil - 5 freq wheaselie - 1 freq waxwell - 1 freq whizzly - 1 freq wauchil - 1 freq wissel - 1 freq 'wascally - 1 freq wooglie - 1 freq wikkly - 1 freq wickly - 2 freq weigle - 1 freq wxl - 2 freq wcgl - 1 freq weasely - 1 freq wuejl - 1 freq wsshl - 1 freq |
MetaPhone code - WSL wisely - 8 freq whussle - 3 freq weasley - 2 freq weasel - 3 freq wicely - 2 freq whussil - 5 freq wheaselie - 1 freq whizzly - 1 freq wissel - 1 freq weasely - 1 freq |
WEASLEY |
| Time to execute Levenshtein function - 0.576001 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.992782 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.043970 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.102783 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.000958 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. |