| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| jurked (0) - 1 freq jerked (1) - 6 freq wurked (1) - 6 freq lurked (1) - 4 freq juries (2) - 1 freq pucked (2) - 1 freq wurker (2) - 3 freq merked (2) - 16 freq urged (2) - 5 freq hurkled (2) - 1 freq purled (2) - 1 freq hurled (2) - 20 freq lucked (2) - 2 freq pursed (2) - 6 freq luiked (2) - 74 freq fucked (2) - 60 freq lueked (2) - 2 freq jurgen (2) - 1 freq barked (2) - 9 freq forked (2) - 3 freq juke (2) - 7 freq sulked (2) - 1 freq yerked (2) - 2 freq burned (2) - 31 freq surged (2) - 1 freq |
jurked (0) - 1 freq jerked (1) - 6 freq lurked (2) - 4 freq wurked (2) - 6 freq worked (3) - 148 freq wirked (3) - 35 freq perked (3) - 2 freq warked (3) - 23 freq marked (3) - 28 freq irked (3) - 1 freq parked (3) - 38 freq yarked (3) - 9 freq jooked (3) - 8 freq jacked (3) - 2 freq jinked (3) - 8 freq jared (3) - 3 freq narked (3) - 1 freq jaiked (3) - 2 freq yerked (3) - 2 freq jouked (3) - 22 freq joked (3) - 9 freq waurked (3) - 1 freq barked (3) - 9 freq merked (3) - 16 freq forked (3) - 3 freq |
SoundEx code - J623 jurisdiction - 6 freq jerked - 6 freq jerkt - 1 freq jurisdictional - 1 freq jurked - 1 freq |
MetaPhone code - JRKT jerked - 6 freq jerkt - 1 freq jurked - 1 freq |
JURKED |
| Time to execute Levenshtein function - 0.212149 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.344791 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.029123 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.037998 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.000786 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. |