| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| wicelike (0) - 11 freq wycelike (1) - 12 freq wicelik (1) - 1 freq wiselike (1) - 6 freq wice-like (1) - 3 freq wycelik (2) - 1 freq wise-like (2) - 3 freq wyce-like (2) - 15 freq siclike (2) - 90 freq wycelyke (2) - 1 freq fifelike (2) - 3 freq sic-like (2) - 11 freq sichlike (2) - 1 freq wilelife (2) - 2 freq wildlife (3) - 15 freq tideline (3) - 1 freq wiceia (3) - 1 freq 'belike (3) - 3 freq siblike (3) - 15 freq kinglike (3) - 1 freq somelike (3) - 2 freq timeline (3) - 14 freq kin-like (3) - 1 freq waa-like (3) - 1 freq kinelie (3) - 1 freq |
wicelike (0) - 11 freq wicelik (1) - 1 freq wycelike (1) - 12 freq wycelyke (2) - 1 freq wycelik (2) - 1 freq wiselike (2) - 6 freq wice-like (2) - 3 freq siclike (3) - 90 freq wyce-like (3) - 15 freq uncolike (4) - 1 freq unwycelike (4) - 1 freq wyce-lyke (4) - 2 freq siclyke (4) - 5 freq doucelike (4) - 2 freq waa-like (4) - 1 freq waeklike (4) - 1 freq wilelife (4) - 2 freq sic-like (4) - 11 freq fifelike (4) - 3 freq wise-like (4) - 3 freq siclik (4) - 21 freq sichlike (4) - 1 freq wicely (4) - 2 freq wyse-like (5) - 1 freq weelie (5) - 3 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 - WSLK wiselike - 6 freq wise-like - 3 freq wice-like - 3 freq wicelik - 1 freq wicelike - 11 freq |
WICELIKE |
| Time to execute Levenshtein function - 0.191461 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.345927 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.027784 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.037002 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.000922 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. |