| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| jinglin (0) - 11 freq tinglin (1) - 7 freq singlin (1) - 1 freq jigglin (1) - 5 freq minglin (1) - 2 freq pinglin (1) - 1 freq jingling (1) - 1 freq janglin (1) - 1 freq singkin (2) - 1 freq gigglin (2) - 13 freq fingin (2) - 1 freq dingin (2) - 59 freq jinkin (2) - 17 freq inklin (2) - 22 freq jiggin (2) - 37 freq ringin (2) - 41 freq swinglin (2) - 1 freq inglis (2) - 218 freq jirgin (2) - 2 freq ingin (2) - 18 freq bingin (2) - 1 freq mingin (2) - 101 freq inclin (2) - 1 freq pinklin (2) - 2 freq tingling (2) - 1 freq |
jinglin (0) - 11 freq janglin (1) - 1 freq minglin (2) - 2 freq jingling (2) - 1 freq pinglin (2) - 1 freq jigglin (2) - 5 freq tinglin (2) - 7 freq singlin (2) - 1 freq jingle (3) - 2 freq jooglin (3) - 10 freq canglin (3) - 1 freq tinglan (3) - 3 freq jeeglin (3) - 1 freq anglin (3) - 2 freq inglan (3) - 9 freq danglin (3) - 16 freq janglin' (3) - 1 freq hingin (4) - 369 freq tinlin (4) - 1 freq kinnlin (4) - 10 freq gingin (4) - 11 freq pingin (4) - 2 freq jugglan (4) - 1 freq dinnlin (4) - 2 freq kindlin (4) - 5 freq |
SoundEx code - J524 jangelt - 1 freq jungle - 38 freq jinglin - 11 freq jangle - 5 freq janglin' - 1 freq jingle-jangle - 2 freq jingle-jangling - 1 freq jungles - 1 freq jangle't - 1 freq junkie-lan - 1 freq jingle - 2 freq 'jingle' - 1 freq 'jingle - 1 freq jingling - 1 freq janglin - 1 freq jinglin'chain - 1 freq johnmacleanma - 2 freq jmcl - 21 freq johnahcoulter - 10 freq jsinclair - 2 freq jankelhirsch - 1 freq jennygilruth - 1 freq jameskellylab - 1 freq jameskelly - 3 freq jimscullion - 1 freq johnhegley - 1 freq janeclarejones - 5 freq jameslewinton - 1 freq jkjgnjjjl - 1 freq joanmcalpine - 22 freq jinglinggeordie - 1 freq |
MetaPhone code - JNKLN jinglin - 11 freq janglin' - 1 freq junkie-lan - 1 freq janglin - 1 freq |
JINGLIN |
| Time to execute Levenshtein function - 0.174475 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.338855 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.027308 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.037222 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.000919 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. |