| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| wiselike (0) - 6 freq wise-like (1) - 3 freq wicelike (1) - 11 freq fifelike (2) - 3 freq dislike (2) - 6 freq wilelife (2) - 2 freq wyse-like (2) - 1 freq wice-like (2) - 3 freq wycelike (2) - 12 freq wicelik (2) - 1 freq siklike (3) - 1 freq siblike (3) - 15 freq wisely (3) - 8 freq wysslik (3) - 1 freq misslie (3) - 1 freq cavelike (3) - 1 freq willile (3) - 1 freq 's'like (3) - 1 freq baseline (3) - 2 freq wisening (3) - 1 freq tideline (3) - 1 freq sic-like (3) - 11 freq bienlike (3) - 2 freq timeline (3) - 14 freq weelie (3) - 3 freq |
wiselike (0) - 6 freq wicelike (2) - 11 freq wise-like (2) - 3 freq wycelike (3) - 12 freq wyse-like (3) - 1 freq dislike (3) - 6 freq wicelik (3) - 1 freq saelike (4) - 3 freq waa-like (4) - 1 freq wycelyke (4) - 1 freq wysslik (4) - 1 freq waeklike (4) - 1 freq wycelik (4) - 1 freq wisely (4) - 8 freq wice-like (4) - 3 freq wilelife (4) - 2 freq fifelike (4) - 3 freq samelike (5) - 2 freq °slike (5) - 1 freq selkie (5) - 17 freq willie (5) - 196 freq somelike (5) - 2 freq fitlike (5) - 1 freq wheelie (5) - 13 freq weirlik (5) - 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 wheezles - 1 freq wice-like - 3 freq wyce-like - 13 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 |
WISELIKE |
| Time to execute Levenshtein function - 0.377567 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.693502 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.079336 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.036952 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.000867 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. |