| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| geggery (0) - 1 freq beggery (1) - 1 freq beggers (2) - 1 freq glegger (2) - 2 freq geekery (2) - 1 freq geggy (2) - 2 freq beggerey (2) - 23 freq piggery (2) - 3 freq buggery (2) - 11 freq beggar (3) - 16 freq loggers (3) - 1 freq gentry (3) - 15 freq buggers (3) - 31 freq gadger (3) - 1 freq bigger' (3) - 1 freq teiger (3) - 1 freq buggert (3) - 3 freq daggers (3) - 12 freq genert (3) - 1 freq grocery (3) - 4 freq gether (3) - 42 freq teegers (3) - 36 freq teeger (3) - 187 freq geometry (3) - 5 freq bugger (3) - 150 freq |
geggery (0) - 1 freq beggery (2) - 1 freq beggerey (3) - 23 freq geggy (3) - 2 freq buggery (3) - 11 freq piggery (3) - 3 freq glegger (3) - 2 freq jigger (4) - 1 freq digger (4) - 12 freq dogger (4) - 1 freq rugger (4) - 2 freq geggies (4) - 1 freq goggsy (4) - 1 freq dagger (4) - 4 freq bigger (4) - 237 freq gagged (4) - 4 freq jagger (4) - 2 freq giggsy (4) - 24 freq gregory (4) - 9 freq geggie (4) - 17 freq logger (4) - 1 freq beigger (4) - 1 freq ginger (4) - 121 freq jogger (4) - 1 freq rigger (4) - 2 freq |
SoundEx code - G260 geezer - 6 freq guizer - 4 freq guiser - 1 freq geggery - 1 freq gokr - 1 freq geekery - 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 |
GEGGERY |
| Time to execute Levenshtein function - 0.274031 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.438822 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.031268 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.039803 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.000942 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. |