| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| jokeroonie (0) - 1 freq roketronnie (3) - 1 freq johonnie (4) - 1 freq broonie (4) - 44 freq joukerie (4) - 3 freq overdone (4) - 1 freq overtone (4) - 1 freq cokernit (4) - 1 freq boxertoye (5) - 1 freq broosie (5) - 2 freq loonie (5) - 35 freq kloodie (5) - 1 freq joannie (5) - 1 freq tertowie (5) - 1 freq joopie (5) - 1 freq johnstone (5) - 35 freq polonie (5) - 1 freq josephine (5) - 11 freq owerlookit (5) - 2 freq hornie (5) - 5 freq boonie (5) - 2 freq droonin (5) - 22 freq kokkeloori (5) - 1 freq karoona (5) - 1 freq kronik (5) - 1 freq |
jokeroonie (0) - 1 freq joukerie (5) - 3 freq krone (6) - 2 freq karoona (6) - 1 freq joker (6) - 7 freq cokernit (6) - 1 freq jakeokane (6) - 3 freq broonie (6) - 44 freq jokers (6) - 2 freq roketronnie (6) - 1 freq johonnie (6) - 1 freq cronie (7) - 2 freq jonnie (7) - 1 freq broone (7) - 1 freq johnnie (7) - 28 freq journey (7) - 111 freq ernie (7) - 50 freq bikerin (7) - 1 freq joker's (7) - 1 freq tournie (7) - 1 freq joaker (7) - 1 freq moderne (7) - 1 freq kennie (7) - 1 freq lerone (7) - 1 freq kertie (7) - 2 freq |
SoundEx code - J265 juggernaut - 3 freq jaqrnsrbx - 1 freq jokeroonie - 1 freq |
MetaPhone code - JKRN jokeroonie - 1 freq |
JOKEROONIE |
| Time to execute Levenshtein function - 0.243200 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.407096 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.028368 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.043991 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.000836 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. |