| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| weasel (0) - 3 freq easel (1) - 1 freq weasely (1) - 1 freq weaved (2) - 2 freq wissel (2) - 1 freq meesel (2) - 2 freq uersel (2) - 1 freq pease (2) - 2 freq weeel (2) - 3 freq eisel (2) - 1 freq whase (2) - 142 freq weaker (2) - 4 freq cease (2) - 10 freq weaves (2) - 8 freq weal (2) - 8 freq eersel (2) - 28 freq teased (2) - 5 freq yesel (2) - 1 freq we'se (2) - 15 freq teases (2) - 6 freq wastel (2) - 1 freq tease (2) - 10 freq eased (2) - 3 freq wesee (2) - 1 freq leased (2) - 2 freq |
weasel (0) - 3 freq weasely (1) - 1 freq weasley (2) - 1 freq easel (2) - 1 freq weaselin (3) - 1 freq yersel (3) - 913 freq reesel (3) - 4 freq easely (3) - 1 freq we'el (3) - 5 freq wesee (3) - 1 freq mesel (3) - 59 freq eesel (3) - 1 freq deesel (3) - 8 freq eezsel (3) - 1 freq wisely (3) - 8 freq warsel (3) - 3 freq maasel (3) - 2 freq eensel (3) - 6 freq weel (3) - 3966 freq masel (3) - 1006 freq ersel (3) - 36 freq weeel (3) - 3 freq eisel (3) - 1 freq desel (3) - 4 freq esel (3) - 2 freq |
SoundEx code - W240 weekly - 24 freq wisely - 8 freq waikly - 3 freq wycely - 2 freq wiggly - 2 freq whussle - 3 freq weegle - 1 freq wauchle - 4 freq weasel - 3 freq wachle - 1 freq wigly - 1 freq weechil - 2 freq wechle - 1 freq weakly - 4 freq waxweel - 1 freq weasley - 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 weasel - 3 freq weasley - 1 freq wicely - 2 freq whussil - 5 freq wheaselie - 1 freq whizzly - 1 freq wissel - 1 freq weasely - 1 freq |
WEASEL |
| Time to execute Levenshtein function - 0.336376 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.458289 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.027091 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.036647 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.000826 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. |