Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
---|---|---|---|---|
jougle (0) - 1 freq joogle (1) - 6 freq jargle (2) - 1 freq rouble (2) - 7 freq goggle (2) - 1 freq shougle (2) - 3 freq jangle (2) - 5 freq ogle (2) - 2 freq rouge (2) - 4 freq dougie (2) - 125 freq doule (2) - 2 freq jungle (2) - 38 freq hourle (2) - 1 freq double (2) - 129 freq couple (2) - 443 freq joogled (2) - 6 freq gouge (2) - 1 freq juggle (2) - 1 freq bogle (2) - 45 freq scougle (2) - 1 freq joggled (2) - 1 freq boggle (2) - 1 freq souple (2) - 12 freq joug (2) - 8 freq jingle (2) - 2 freq |
jougle (0) - 1 freq joogle (1) - 6 freq joug (3) - 8 freq jingle (3) - 2 freq bogle (3) - 45 freq juggle (3) - 1 freq joggie (3) - 2 freq jougs (3) - 9 freq jookle (3) - 2 freq google (3) - 80 freq jooglet (3) - 1 freq jooglt (3) - 1 freq joogled (3) - 6 freq foogle (3) - 1 freq bugle (3) - 2 freq ogle (3) - 2 freq jungle (3) - 38 freq jargle (3) - 1 freq jangle (3) - 5 freq googly (4) - 3 freq jowly (4) - 2 freq aggle (4) - 2 freq joogied (4) - 1 freq baigle (4) - 1 freq gle (4) - 4 freq |
SoundEx code - J240 jekyll - 14 freq jougle - 1 freq joogle - 6 freq juickly - 1 freq jeekyll - 2 freq jookle - 2 freq jacquel - 3 freq joogal - 1 freq jackal - 1 freq jajahl - 1 freq juggle - 1 freq joshhall - 1 freq |
MetaPhone code - JKL giggle - 21 freq jekyll - 14 freq jougle - 1 freq joogle - 6 freq geggle - 1 freq geegly - 1 freq juickly - 1 freq jeekyll - 2 freq jookle - 2 freq jql - 1 freq joogal - 1 freq jackal - 1 freq juggle - 1 freq |
JOUGLE |
Time to execute Levenshtein function - 0.314898 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.599720 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.053581 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.038849 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.001099 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. |