| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| joggled (0) - 1 freq joogled (1) - 6 freq jogged (1) - 2 freq aggled (2) - 1 freq toggle (2) - 1 freq goggle (2) - 1 freq coogled (2) - 1 freq waggled (2) - 2 freq logged (2) - 2 freq jigged (2) - 4 freq juggles (2) - 1 freq boggle (2) - 1 freq giggled (2) - 7 freq goggles (2) - 10 freq bogged (2) - 3 freq wiggled (2) - 3 freq joggie (2) - 2 freq joogied (2) - 1 freq joogle (2) - 6 freq joggies (2) - 1 freq jagged (2) - 9 freq boggles (2) - 3 freq toggles (2) - 1 freq jougle (2) - 1 freq googled (2) - 1 freq |
joggled (0) - 1 freq jogged (2) - 2 freq joogled (2) - 6 freq juggle (3) - 1 freq jiggles (3) - 2 freq wiggled (3) - 3 freq jagged (3) - 9 freq googled (3) - 1 freq juggles (3) - 1 freq puggled (3) - 21 freq giggled (3) - 7 freq jigged (3) - 4 freq waggled (3) - 2 freq aggled (3) - 1 freq geegled (4) - 2 freq cogged (4) - 2 freq jogger (4) - 1 freq fogged (4) - 1 freq jooglet (4) - 1 freq jostled (4) - 3 freq piggledy (4) - 1 freq jugglan (4) - 1 freq jiggered (4) - 3 freq dogged (4) - 3 freq jigglin (4) - 5 freq |
SoundEx code - J243 joogled - 6 freq joogelt - 1 freq joggled - 1 freq jiggilt - 1 freq jakolet - 1 freq jooglt - 1 freq jooglet - 1 freq |
MetaPhone code - JKLT geegled - 2 freq joogled - 6 freq giggled - 7 freq giggilt - 12 freq joggled - 1 freq giggult - 4 freq jiggilt - 1 freq jakolet - 1 freq jooglt - 1 freq jooglet - 1 freq geeglet - 1 freq jqliuhd - 1 freq |
JOGGLED |
| Time to execute Levenshtein function - 0.219538 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.526968 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.076265 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.099050 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.000985 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. |