| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| jiggered (0) - 3 freq buggered (2) - 13 freq sniggered (2) - 4 freq fingered (2) - 1 freq lingered (2) - 4 freq jigged (2) - 4 freq jigger (2) - 1 freq jigger' (2) - 1 freq triggered (2) - 2 freq laggered (2) - 2 freq pippered (3) - 1 freq wittered (3) - 6 freq mizzered (3) - 2 freq jogger (3) - 1 freq lippered (3) - 2 freq eigged (3) - 1 freq siffered (3) - 2 freq figger (3) - 6 freq moagered (3) - 1 freq widdered (3) - 2 freq giggled (3) - 7 freq wiggled (3) - 3 freq sindered (3) - 3 freq beggerey (3) - 23 freq angered (3) - 2 freq |
jiggered (0) - 3 freq jigger (3) - 1 freq laggered (3) - 2 freq jigger' (3) - 1 freq jigged (3) - 4 freq buggered (3) - 13 freq jogged (4) - 2 freq jagger (4) - 2 freq joggers (4) - 1 freq joggled (4) - 1 freq jagged (4) - 9 freq jogger (4) - 1 freq fingered (4) - 1 freq sniggered (4) - 4 freq lingered (4) - 4 freq triggered (4) - 2 freq digger (5) - 12 freq jowered (5) - 1 freq jinged (5) - 1 freq fingerd (5) - 1 freq kiggerin (5) - 1 freq bigged (5) - 30 freq pigged (5) - 1 freq rigged (5) - 11 freq diggers (5) - 1 freq |
SoundEx code - J263 jiggered - 3 freq jesird - 1 freq jakarta - 1 freq |
MetaPhone code - JKRT jiggered - 3 freq jakarta - 1 freq |
JIGGERED |
| Time to execute Levenshtein function - 0.262022 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.391649 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.027733 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.041167 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.001156 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. |