| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| wqwlzwio (0) - 1 freq wildwood (5) - 1 freq bowlit (5) - 1 freq pawlin (5) - 1 freq weel-noo (5) - 1 freq weildin (5) - 1 freq wilkin (5) - 2 freq wowczxbj (5) - 1 freq pullzit (5) - 1 freq plewin (5) - 1 freq billowin (5) - 3 freq walthie (5) - 6 freq qwwdci (5) - 1 freq while-o (5) - 3 freq aalwis (5) - 6 freq wheezlin (5) - 1 freq lwo (5) - 1 freq blowin (5) - 14 freq bawlin (5) - 19 freq wellwood (5) - 13 freq walkit (5) - 37 freq qwagwm (5) - 1 freq wallie (5) - 25 freq whirlwin (5) - 1 freq yawlie (5) - 2 freq |
wqwlzwio (0) - 1 freq qlw (8) - 1 freq hqwzs (8) - 1 freq wallow (8) - 4 freq wawly (8) - 1 freq qlzx (8) - 1 freq willow (8) - 15 freq qwz (8) - 1 freq ywowlin (8) - 1 freq www (8) - 176 freq mqdlw (8) - 1 freq wqw (8) - 1 freq qzw (8) - 1 freq wwww (8) - 1 freq waelz (8) - 1 freq wi-wi-wi (8) - 1 freq awwwww (9) - 7 freq willreid (9) - 13 freq dewlie (9) - 1 freq wullhie (9) - 1 freq waqwwekp (9) - 1 freq whalpit (9) - 4 freq willno (9) - 1 freq wanwit (9) - 1 freq williew (9) - 1 freq |
SoundEx code - W242 wiselike - 6 freq wyce-lyke - 2 freq wiggles - 2 freq whussles - 2 freq wycelik - 1 freq wise-like - 3 freq waggles - 1 freq wyce-like - 15 freq wheezles - 1 freq wice-like - 3 freq wish-list - 1 freq weechils - 1 freq weggles - 1 freq waxy-lookin - 1 freq waxylookin - 1 freq wicelik - 1 freq wicelike - 11 freq wiggle-waggled - 1 freq wiggle-waggle - 2 freq wycelike - 12 freq waeklike - 1 freq wysslik - 1 freq wycelyke - 1 freq €œwaizels - 1 freq wyse-like - 1 freq wice-leukin - 1 freq weesles - 1 freq wqwlzwio - 1 freq |
MetaPhone code - KLSW wqwlzwio - 1 freq |
WQWLZWIO |
| Time to execute Levenshtein function - 0.193453 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.370858 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.027884 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.037501 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.000872 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. |