| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| zechariah (0) - 19 freq zephaniah (2) - 3 freq zechariah's (2) - 4 freq sectarian (3) - 5 freq bzephaniah (3) - 1 freq carian (4) - 1 freq nehemiah (4) - 1 freq recharge (4) - 1 freq mechanism (4) - 4 freq zerah (4) - 1 freq jeconiah (4) - 4 freq eucharist (4) - 3 freq mechanical (4) - 19 freq zarah (4) - 1 freq chariot (4) - 4 freq pharoah (4) - 1 freq pechtish (4) - 33 freq mechanival (4) - 1 freq nechatan (4) - 1 freq declaris (4) - 2 freq mechanik (4) - 1 freq charity (4) - 41 freq azariah (4) - 2 freq mechanics (4) - 6 freq cherish (4) - 8 freq |
zechariah (0) - 19 freq zechariah's (4) - 4 freq zephaniah (4) - 3 freq cherish (6) - 8 freq chureh (6) - 1 freq chariot (6) - 4 freq zerah (6) - 1 freq zarah (6) - 1 freq recharge (6) - 1 freq bzephaniah (6) - 1 freq sectarian (6) - 5 freq azariah (6) - 2 freq charity (6) - 41 freq pharoah (6) - 1 freq schairp (7) - 1 freq chairity (7) - 3 freq zephyr (7) - 2 freq tocherin (7) - 1 freq zchiz (7) - 1 freq chairm (7) - 11 freq cherie (7) - 2 freq mcharg (7) - 1 freq chairt (7) - 17 freq lecher (7) - 1 freq racherie (7) - 1 freq |
SoundEx code - Z260 zechariah - 19 freq zucker - 1 freq zwesr - 1 freq zojyr - 1 freq |
MetaPhone code - SXR sea-shore- - 4 freq seashore - 3 freq schir - 2 freq sea-shore - 1 freq schare - 1 freq zechariah - 19 freq schyre - 1 freq schore - 1 freq schoir - 1 freq schar - 1 freq sicher - 1 freq |
ZECHARIAH |
| Time to execute Levenshtein function - 0.326852 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.578627 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.027303 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.074783 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.001013 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. |