| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| jurisdictional (0) - 1 freq jurisdiction (2) - 6 freq doricdictionary (5) - 18 freq traditional (5) - 68 freq tradeitional (6) - 22 freq edicational (6) - 2 freq feictional (6) - 1 freq directional (6) - 1 freq unintentional (6) - 1 freq fictional (6) - 3 freq disfunctional (6) - 1 freq positional (6) - 1 freq muisicial (6) - 1 freq judicial (6) - 2 freq dictionar (6) - 95 freq tradeetional (6) - 59 freq purification (6) - 1 freq eddicational (6) - 6 freq unconditional (6) - 5 freq conditional (6) - 2 freq additional (6) - 14 freq functional (6) - 11 freq derivational (6) - 6 freq 'traditional' (6) - 3 freq tradítional (6) - 1 freq |
jurisdictional (0) - 1 freq jurisdiction (3) - 6 freq traditional (8) - 68 freq doricdictionary (8) - 18 freq eddicational (9) - 6 freq redictions (9) - 1 freq prediction (9) - 6 freq tradeetional (9) - 59 freq predictions (9) - 3 freq tradeitional (9) - 22 freq directional (9) - 1 freq edicational (9) - 2 freq educational (10) - 55 freq fictional (10) - 3 freq feictional (10) - 1 freq transitional (10) - 1 freq reduction (10) - 3 freq productions (10) - 12 freq predicting (10) - 3 freq disfunctional (10) - 1 freq predication (10) - 4 freq production (10) - 48 freq tradítional (10) - 1 freq tradeetinal (10) - 1 freq purification (10) - 1 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 - JRSTKXNL jurisdictional - 1 freq |
JURISDICTIONAL |
| Time to execute Levenshtein function - 0.300051 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.405403 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.027325 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.037259 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.000950 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. |