Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
---|---|---|---|---|
jehoram (0) - 2 freq jehovah (2) - 1 freq joram (2) - 2 freq jonam (3) - 3 freq jorim (3) - 3 freq reform (3) - 42 freq memoriam (3) - 5 freq enorm (3) - 11 freq goram (3) - 1 freq choral (3) - 2 freq fedora (3) - 3 freq menorah (3) - 1 freq ceram (3) - 1 freq ashram (3) - 6 freq thora (3) - 1 freq decora (3) - 1 freq hoam (3) - 4 freq decorum (3) - 3 freq rehoboam (3) - 2 freq jorum (3) - 1 freq deform (3) - 1 freq jerah (3) - 3 freq jetsam (3) - 1 freq oral (4) - 23 freq sahara (4) - 7 freq |
jehoram (0) - 2 freq joram (3) - 2 freq ashram (4) - 6 freq jorim (4) - 3 freq jorum (4) - 1 freq jehovah (4) - 1 freq harm (5) - 22 freq jetsam (5) - 1 freq deform (5) - 1 freq thrum (5) - 12 freq cherm (5) - 5 freq charm (5) - 30 freq chirm (5) - 1 freq jeremy (5) - 12 freq theorem (5) - 1 freq thrym (5) - 10 freq rehoboam (5) - 2 freq chrom (5) - 1 freq jerah (5) - 3 freq decorum (5) - 3 freq choral (5) - 2 freq enorm (5) - 11 freq memoriam (5) - 5 freq jonam (5) - 3 freq reform (5) - 42 freq |
SoundEx code - J650 journey - 111 freq jsreen - 1 freq jorum - 1 freq jurney - 2 freq jeerin - 3 freq jeremey - 1 freq jeremy - 12 freq journo - 1 freq jehoram - 2 freq jeremiah - 4 freq jorim - 3 freq joram - 2 freq jurnay - 6 freq jurnai - 1 freq journey' - 1 freq journay - 3 freq €œjourney - 1 freq jarrin - 2 freq |
MetaPhone code - JHRM jehoram - 2 freq |
JEHORAM |
Time to execute Levenshtein function - 0.218652 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.402212 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.028079 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.038294 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.000941 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. |