| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| weesles (0) - 1 freq weeshes (1) - 1 freq measles (2) - 5 freq peesies (2) - 2 freq peebles (2) - 8 freq reevles (2) - 1 freq deesle (2) - 3 freq weejies (2) - 1 freq weel's (2) - 16 freq wheezles (2) - 1 freq weeglet (2) - 1 freq reesled (2) - 1 freq warsles (2) - 2 freq weegle (2) - 1 freq wrestles (2) - 1 freq feefles (2) - 1 freq easles (2) - 2 freq eeses (2) - 1 freq needles (2) - 17 freq weeflas (2) - 3 freq wheeples (2) - 1 freq teetles (2) - 1 freq beetles (2) - 2 freq weasley (2) - 2 freq reeses (2) - 1 freq |
weesles (0) - 1 freq weeshes (2) - 1 freq weesks (3) - 1 freq warsles (3) - 2 freq weeflas (3) - 3 freq weasley (3) - 2 freq weles (3) - 1 freq easles (3) - 2 freq weishes (3) - 3 freq measles (3) - 5 freq wheils (4) - 1 freq wersels (4) - 1 freq resiles (4) - 1 freq wises (4) - 1 freq westies (4) - 1 freq wyles (4) - 2 freq musles (4) - 1 freq aisles (4) - 3 freq wiles (4) - 11 freq wastes (4) - 4 freq washes (4) - 11 freq wishes (4) - 39 freq weiss (4) - 2 freq wisses (4) - 4 freq sles (4) - 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 - WSLS whussles - 2 freq wheezles - 1 freq €œwaizels - 1 freq weesles - 1 freq |
WEESLES |
| Time to execute Levenshtein function - 0.244300 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.417393 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.029056 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.040307 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.000911 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. |