| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| religious (0) - 51 freq religioun (1) - 5 freq releigious (1) - 8 freq religions (1) - 2 freq releigiouns (2) - 2 freq delirious (2) - 3 freq delicious (2) - 24 freq religion (2) - 56 freq releegious (2) - 24 freq releigioun (2) - 4 freq religiously (2) - 2 freq veicious (3) - 6 freq releigion' (3) - 1 freq deleicious (3) - 1 freq oblivious (3) - 14 freq relatiouns (3) - 1 freq prestigious (3) - 6 freq releigion (3) - 1 freq regions (3) - 20 freq relatioun (3) - 3 freq litigious (3) - 1 freq releegions (3) - 3 freq malicious (3) - 1 freq melodious (3) - 1 freq relations (3) - 14 freq |
religious (0) - 51 freq releigious (1) - 8 freq releegious (2) - 24 freq religions (2) - 2 freq religioun (2) - 5 freq releigioun (3) - 4 freq religion (3) - 56 freq religiously (3) - 2 freq releigiouns (3) - 2 freq delirious (4) - 3 freq releigion (4) - 1 freq releegions (4) - 3 freq delicious (4) - 24 freq elegies (5) - 3 freq relies (5) - 1 freq realities (5) - 9 freq reliques (5) - 1 freq melodious (5) - 1 freq relieves (5) - 2 freq relics (5) - 6 freq releejus (5) - 1 freq releegion (5) - 18 freq relations (5) - 14 freq relatiouns (5) - 1 freq regions (5) - 20 freq |
SoundEx code - R422 releegious - 24 freq realises - 9 freq religious - 51 freq rilke's - 1 freq releases - 3 freq religiously - 2 freq releejus - 1 freq releigious - 8 freq relaxes - 2 freq religiosity - 1 freq reliques - 1 freq relishes - 1 freq |
MetaPhone code - RLJS releegious - 24 freq religious - 51 freq releejus - 1 freq releigious - 8 freq |
RELIGIOUS |
| Time to execute Levenshtein function - 0.304977 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.583859 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.028481 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.072797 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.000895 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. |