| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| reliable (0) - 5 freq reliably (1) - 1 freq rewable (2) - 1 freq reliance (2) - 4 freq relatable (2) - 3 freq veluable (2) - 3 freq realisable (2) - 1 freq liable (2) - 4 freq unreliable (2) - 2 freq enviable (3) - 1 freq vejitable (3) - 1 freq redials (3) - 1 freq believable (3) - 3 freq recile (3) - 1 freq reliant (3) - 3 freq reperable (3) - 1 freq deeable (3) - 1 freq kenable (3) - 19 freq revile (3) - 3 freq enable (3) - 4 freq peetiable (3) - 2 freq kennable (3) - 3 freq veritable (3) - 2 freq belittle (3) - 1 freq relive (3) - 1 freq |
reliable (0) - 5 freq reliably (1) - 1 freq realisable (3) - 1 freq veluable (3) - 3 freq liable (3) - 4 freq unreliable (3) - 2 freq relatable (3) - 3 freq rewable (3) - 1 freq reliance (4) - 4 freq risible (4) - 1 freq valuable (4) - 18 freq relieve (5) - 2 freq culpable (5) - 2 freq friable (5) - 2 freq reputable (5) - 3 freq heritable (5) - 4 freq legible (5) - 3 freq resemble (5) - 3 freq reishle (5) - 2 freq renewable (5) - 2 freq syllable (5) - 12 freq greeable (5) - 4 freq edible (5) - 3 freq eligible (5) - 4 freq abailable (5) - 1 freq |
SoundEx code - R414 rolly-polly - 1 freq reliable - 5 freq role-play - 2 freq roleplay - 1 freq reliably - 1 freq realevilhrlady - 1 freq realpaulmartin - 2 freq |
MetaPhone code - RLBL reliable - 5 freq reliably - 1 freq |
RELIABLE |
| Time to execute Levenshtein function - 0.182827 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.360004 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.028744 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.040646 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.000831 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. |