| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| jeggins (0) - 1 freq leggins (1) - 3 freq jeggies (1) - 1 freq beggin' (2) - 1 freq jiggin (2) - 37 freq seggans (2) - 3 freq seggies (2) - 1 freq jaggies (2) - 4 freq coggins (2) - 1 freq muggins (2) - 8 freq jenkins (2) - 4 freq jaggin (2) - 9 freq eggies (2) - 4 freq jeggit (2) - 4 freq beggin (2) - 33 freq joogins (2) - 2 freq leggings (2) - 3 freq jogging (2) - 1 freq joggies (2) - 1 freq biggins (2) - 54 freq joggin (2) - 9 freq leggies (2) - 10 freq jeggie (2) - 1 freq geggies (2) - 1 freq begins (2) - 83 freq |
jeggins (0) - 1 freq jeggies (2) - 1 freq leggins (2) - 3 freq jogging (3) - 1 freq joogins (3) - 2 freq joggies (3) - 1 freq higgins (3) - 23 freq jaggin (3) - 9 freq joggin (3) - 9 freq biggins (3) - 54 freq noggins (3) - 2 freq jaggies (3) - 4 freq seggans (3) - 3 freq coggins (3) - 1 freq muggins (3) - 8 freq jiggin (3) - 37 freq joggan (4) - 1 freq peggies (4) - 1 freq leggis (4) - 1 freq jenkins (4) - 4 freq biggans (4) - 6 freq juggs (4) - 2 freq juggles (4) - 1 freq joggers (4) - 1 freq jiggles (4) - 2 freq |
SoundEx code - J252 jeggins - 1 freq jogging - 1 freq jackson's - 2 freq jockina's - 2 freq jessons - 1 freq jowking - 1 freq joogins - 2 freq joking - 1 freq joycemcm - 3 freq jackmcisback - 1 freq jacking - 1 freq jockmcleod - 8 freq jakemoyes - 81 freq jasons - 1 freq jackmcalpine - 1 freq |
MetaPhone code - JKNS jeggins - 1 freq jockina's - 2 freq |
JEGGINS |
| Time to execute Levenshtein function - 0.282307 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.436740 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.033293 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.047500 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.001179 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. |