| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| jurisdiction (0) - 6 freq jurisdictional (2) - 1 freq prediction (4) - 6 freq purification (4) - 1 freq eriction (5) - 1 freq friction (5) - 9 freq predictin (5) - 2 freq wormsection (5) - 1 freq production (5) - 48 freq dereliction (5) - 1 freq predication (5) - 4 freq malediction (5) - 2 freq misdirection (5) - 1 freq radiation (5) - 3 freq furstration (5) - 1 freq valediction (5) - 1 freq perdition (5) - 1 freq quaistion (5) - 21 freq quistion (5) - 8 freq muisician (5) - 2 freq justification (5) - 3 freq addiction (5) - 9 freq audition (5) - 8 freq tradietion (5) - 1 freq humiliation (5) - 5 freq |
jurisdiction (0) - 6 freq jurisdictional (3) - 1 freq prediction (6) - 6 freq production (7) - 48 freq predication (7) - 4 freq predictin (7) - 2 freq purification (7) - 1 freq reduction (7) - 3 freq junction (8) - 11 freq presicion (8) - 1 freq diction (8) - 9 freq dissection (8) - 2 freq rendition (8) - 6 freq indication (8) - 5 freq redictions (8) - 1 freq predictions (8) - 3 freq redactioun (8) - 1 freq respectin (8) - 4 freq persecution (8) - 10 freq ersification (8) - 1 freq seduction (8) - 2 freq prosecution (8) - 3 freq tradition (8) - 55 freq productioun (8) - 5 freq induction (8) - 2 freq |
SoundEx code - J623 jurisdiction - 6 freq jerked - 6 freq jarcket - 1 freq jerket - 1 freq jerkt - 1 freq jurisdictional - 1 freq jurked - 1 freq |
MetaPhone code - JRSTKXN jurisdiction - 6 freq |
JURISDICTION |
| Time to execute Levenshtein function - 0.196517 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.353183 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.028758 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.037453 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.000958 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. |