| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| jagger (0) - 2 freq jigger (1) - 1 freq jogger (1) - 1 freq dagger (1) - 4 freq jagged (1) - 9 freq taggert (2) - 1 freq jigged (2) - 4 freq jagg (2) - 1 freq cadger (2) - 5 freq wagged (2) - 3 freq rigger (2) - 2 freq hagged (2) - 2 freq pager (2) - 1 freq darger (2) - 2 freq wagner (2) - 1 freq dogger (2) - 1 freq jazzer (2) - 1 freq ganger (2) - 1 freq figger (2) - 6 freq jaggy (2) - 22 freq stagger (2) - 15 freq mauger (2) - 8 freq danger (2) - 110 freq bagged (2) - 4 freq ranger (2) - 8 freq |
jagger (0) - 2 freq jogger (1) - 1 freq jigger (1) - 1 freq jagged (2) - 9 freq dagger (2) - 4 freq jaggies (3) - 4 freq jaggie (3) - 8 freq bugger (3) - 150 freq jogged (3) - 2 freq jigger' (3) - 1 freq logger (3) - 1 freq jaggit (3) - 7 freq bigger (3) - 237 freq jaguar (3) - 2 freq rugger (3) - 2 freq jaggin (3) - 10 freq jagwar (3) - 1 freq ligger (3) - 1 freq joggers (3) - 1 freq digger (3) - 12 freq jaggy (3) - 22 freq rigger (3) - 2 freq dogger (3) - 1 freq jagg (3) - 1 freq figger (3) - 6 freq |
SoundEx code - J260 joukerie - 3 freq juicier - 1 freq jouker - 2 freq jagger - 2 freq joker - 7 freq joaker - 1 freq joukery- - 1 freq jaguar - 2 freq jagwar - 1 freq jogger - 1 freq jazzer - 1 freq juicer - 1 freq jigger' - 1 freq jigger - 1 freq |
MetaPhone code - JKR joukerie - 3 freq hjckrrh - 5 freq jckrrh - 1 freq jouker - 2 freq jagger - 2 freq joker - 7 freq joaker - 1 freq joukery- - 1 freq jaguar - 2 freq jogger - 1 freq geggery - 1 freq geekery - 1 freq jigger' - 1 freq jigger - 1 freq |
JAGGER |
| Time to execute Levenshtein function - 0.234732 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.392965 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.029116 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.039338 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.001120 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. |