Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
---|---|---|---|---|
wangled (0) - 1 freq waggled (1) - 2 freq mangled (1) - 6 freq dangled (1) - 2 freq tangled (1) - 10 freq fangled (1) - 3 freq fankled (2) - 14 freq rankled (2) - 1 freq dangles (2) - 1 freq tanglet (2) - 1 freq wandred (2) - 1 freq rangles (2) - 1 freq han'led (2) - 1 freq eagled (2) - 1 freq hannled (2) - 2 freq wauled (2) - 1 freq dwanged (2) - 1 freq ganglee (2) - 1 freq waggles (2) - 1 freq angle (2) - 22 freq waffled (2) - 1 freq angles (2) - 29 freq fangle (2) - 1 freq waned (2) - 6 freq angler (2) - 1 freq |
wangled (0) - 1 freq tangled (2) - 10 freq dangled (2) - 2 freq fangled (2) - 3 freq mangled (2) - 6 freq waggled (2) - 2 freq mingled (3) - 6 freq tingled (3) - 1 freq wiggled (3) - 3 freq winkled (3) - 1 freq winged (3) - 5 freq mungled (3) - 1 freq singled (3) - 1 freq wengle (3) - 1 freq taigled (4) - 3 freq wanced (4) - 3 freq handled (4) - 7 freq waeled (4) - 5 freq tangle (4) - 6 freq wadged (4) - 1 freq cangle (4) - 2 freq hanged (4) - 6 freq walled (4) - 2 freq wranged (4) - 2 freq banged (4) - 26 freq |
SoundEx code - W524 winkle-picker's - 1 freq winkler - 1 freq wangled - 1 freq wan-o-clock - 1 freq wengle - 1 freq winkled - 1 freq winnock-soles - 1 freq wingilt - 1 freq weans'll - 1 freq waenglit - 1 freq winkelstrjitten - 1 freq winkels - 1 freq weensland - 1 freq wine-colourt - 1 freq |
MetaPhone code - WNKLT wangled - 1 freq winkled - 1 freq waenglit - 1 freq |
WANGLED |
Time to execute Levenshtein function - 0.236570 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.392678 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.028420 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.042592 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.001252 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. |