| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| jinkit (0) - 7 freq dinkit (1) - 1 freq jinkin (1) - 17 freq winkit (1) - 11 freq linkit (1) - 15 freq sinkit (1) - 1 freq tinkit (1) - 1 freq junkit (1) - 1 freq jintit (1) - 1 freq jinking (2) - 1 freq intit (2) - 11 freq rinkin (2) - 1 freq pikkit (2) - 1 freq jookit (2) - 3 freq jimpit (2) - 5 freq jeckit (2) - 3 freq pinkin (2) - 1 freq jokit (2) - 8 freq binkin (2) - 1 freq jint (2) - 6 freq jinked (2) - 8 freq juikit (2) - 1 freq wickit (2) - 36 freq hintit (2) - 2 freq hunkit (2) - 2 freq |
jinkit (0) - 7 freq junkit (1) - 1 freq tinkit (2) - 1 freq dinkit (2) - 1 freq sinkit (2) - 1 freq jintit (2) - 1 freq linkit (2) - 15 freq jinkin (2) - 17 freq winkit (2) - 11 freq jinky (3) - 5 freq linkt (3) - 2 freq jyntit (3) - 1 freq yunkit (3) - 1 freq yankit (3) - 1 freq jynit (3) - 3 freq jaskit (3) - 1 freq hankit (3) - 2 freq gunkit (3) - 1 freq junkie (3) - 37 freq jinks (3) - 8 freq jinker (3) - 2 freq mankit (3) - 8 freq jaickit (3) - 16 freq jeukit (3) - 2 freq joukit (3) - 15 freq |
SoundEx code - J523 jinkwhit - 1 freq jinked - 8 freq johnston - 18 freq junction - 11 freq junctien's - 1 freq joanstoon - 1 freq johnston' - 1 freq johnstone - 35 freq jinged - 1 freq jinkit - 7 freq jaunched - 1 freq jinxed - 2 freq jensdóttir - 1 freq jamstane - 1 freq junkit - 1 freq jensdottir - 2 freq janeygodley - 50 freq janegotagun - 1 freq jmacdeee - 1 freq jamestudhope - 2 freq johnmcd - 2 freq joewhimster - 7 freq jamieeast - 2 freq jamesaithie - 3 freq jamesdoleman - 4 freq janeygodley's - 1 freq jomcd - 3 freq johnwest - 4 freq jamesedwinmusic - 1 freq jwmmctykzk - 1 freq jmscd - 1 freq jonstackpool - 1 freq |
MetaPhone code - JNKT jinked - 8 freq jinkit - 7 freq junkit - 1 freq |
JINKIT |
| Time to execute Levenshtein function - 0.284720 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.545451 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.038372 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.038789 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.000797 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. |