| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| israelite (0) - 1 freq israelites (1) - 1 freq israeli (2) - 2 freq israelfa (3) - 1 freq israel's (3) - 2 freq raelitie (3) - 2 freq israel (3) - 45 freq israel' (3) - 1 freq raelity (3) - 1 freq raelie (3) - 3 freq raelise (3) - 4 freq saelike (3) - 3 freq bekalite (4) - 1 freq recite (4) - 9 freq swallit (4) - 2 freq starlit (4) - 1 freq scailit (4) - 2 freq orra-like (4) - 1 freq delite (4) - 4 freq saetit (4) - 1 freq relate (4) - 18 freq crawlie (4) - 2 freq isolate (4) - 8 freq sklite (4) - 1 freq snawline (4) - 1 freq |
israelite (0) - 1 freq israelites (2) - 1 freq israeli (3) - 2 freq israel' (4) - 1 freq raelity (4) - 1 freq israel (4) - 45 freq raelitie (4) - 2 freq israelfa (4) - 1 freq morality (5) - 8 freq skailit (5) - 1 freq sklite (5) - 1 freq isolate (5) - 8 freq salute (5) - 19 freq slite (5) - 4 freq relate (5) - 18 freq sailit (5) - 10 freq dreelit (5) - 1 freq snarlit (5) - 1 freq fraility (5) - 1 freq saulit (5) - 1 freq escalate (5) - 3 freq starlit (5) - 1 freq scailit (5) - 2 freq israel's (5) - 2 freq raelise (5) - 4 freq |
SoundEx code - I264 israel - 45 freq israel's - 2 freq israelite - 1 freq israel' - 1 freq israelites - 1 freq israeli - 2 freq israelfa - 1 freq |
MetaPhone code - ISRLT israelite - 1 freq |
ISRAELITE |
| Time to execute Levenshtein function - 0.695814 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.695554 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.037559 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.071342 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.000876 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. |