| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| releegious (0) - 24 freq releigious (1) - 8 freq releegions (1) - 3 freq releigiouns (2) - 2 freq religious (2) - 50 freq releegion (2) - 18 freq deleerious (2) - 1 freq releigioun (2) - 4 freq deleecious (2) - 1 freq presteegious (3) - 1 freq deleicious (3) - 1 freq religions (3) - 2 freq releejus (3) - 1 freq releigion' (3) - 1 freq egregious (3) - 1 freq releigion (3) - 1 freq relaetions (3) - 2 freq reveesions (3) - 1 freq obleevious (3) - 1 freq rebellious (3) - 4 freq maleecious (3) - 1 freq religioun (3) - 5 freq keerious (4) - 3 freq relegations (4) - 1 freq preecious (4) - 2 freq |
releegious (0) - 24 freq releigious (1) - 8 freq religious (2) - 50 freq releegions (2) - 3 freq releegion (3) - 18 freq releigioun (3) - 4 freq releigiouns (3) - 2 freq religions (4) - 2 freq releejus (4) - 1 freq releigion (4) - 1 freq deleerious (4) - 1 freq deleecious (4) - 1 freq religioun (4) - 5 freq rebellious (5) - 4 freq elegies (5) - 2 freq obleevious (5) - 1 freq religiously (5) - 2 freq maleecious (5) - 1 freq releigion' (5) - 1 freq religion (5) - 56 freq relaetions (5) - 2 freq deleicious (5) - 1 freq egregious (5) - 1 freq relations (6) - 14 freq leegs (6) - 1 freq |
SoundEx code - R422 releegious - 24 freq realises - 6 freq religious - 50 freq rilke's - 1 freq religiously - 2 freq releases - 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 - 50 freq releejus - 1 freq releigious - 8 freq |
RELEEGIOUS |
| Time to execute Levenshtein function - 0.228274 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.363609 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.027770 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.036781 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.000797 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. |