| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| resiles (0) - 1 freq resides (1) - 1 freq resile (1) - 1 freq resiled (1) - 2 freq besides (2) - 35 freq recile (2) - 1 freq trestles (2) - 1 freq reives (2) - 2 freq restless (2) - 15 freq exiles (2) - 4 freq reevles (2) - 1 freq wrestles (2) - 1 freq recipes (2) - 17 freq rosines (2) - 1 freq resins (2) - 1 freq rosies (2) - 2 freq siles (2) - 1 freq relies (2) - 1 freq revile (2) - 3 freq desires (2) - 10 freq results (2) - 70 freq reviled (2) - 2 freq resigns (2) - 1 freq refills (2) - 1 freq retailed (3) - 1 freq |
resiles (0) - 1 freq resiled (2) - 2 freq resile (2) - 1 freq resides (2) - 1 freq resins (3) - 1 freq rosines (3) - 1 freq results (3) - 70 freq reevles (3) - 1 freq relies (3) - 1 freq siles (3) - 1 freq rosies (3) - 2 freq rests (4) - 11 freq musles (4) - 1 freq roles (4) - 12 freq orestes (4) - 2 freq rises (4) - 41 freq roses (4) - 102 freq resets (4) - 1 freq reishils (4) - 1 freq soles (4) - 16 freq sles (4) - 1 freq easles (4) - 2 freq reists (4) - 1 freq reels (4) - 20 freq reesled (4) - 1 freq |
SoundEx code - R242 rough-lookin - 1 freq recalcitrate - 1 freq recalls - 5 freq rackless - 1 freq rickles - 3 freq reek-less - 1 freq recollection - 2 freq risqué-leukin - 1 freq rochlookin - 1 freq rascals - 1 freq russell's - 3 freq resiles - 1 freq reckless - 2 freq rachel's - 2 freq roch-lik - 1 freq recklessness - 2 freq ruckles - 1 freq recleckit - 1 freq ragglish-like - 1 freq ragglish - 3 freq recollections - 1 freq reclessified - 1 freq recalcitrant - 2 freq recoils - 1 freq reishils - 1 freq rochles - 1 freq reekless - 1 freq roxywells - 3 freq regulus - 2 freq rossalcroft - 1 freq rjhhlckmda - 1 freq rosscolquhoun - 2 freq russellexolta - 1 freq reclusive - 1 freq rglktwyp - 1 freq |
MetaPhone code - RSLS russell's - 3 freq resiles - 1 freq |
RESILES |
| Time to execute Levenshtein function - 0.194093 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.388173 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.028152 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.042325 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.000849 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. |