| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| geggle (0) - 1 freq eggle (1) - 2 freq gaggle (1) - 5 freq geggie (1) - 17 freq goggle (1) - 1 freq giggle (1) - 21 freq geggy (2) - 2 freq gemmle (2) - 2 freq raggle (2) - 207 freq gurgle (2) - 2 freq geile (2) - 1 freq giggled (2) - 7 freq legge (2) - 8 freq reggie (2) - 1 freq geggies (2) - 1 freq weggles (2) - 1 freq eggie (2) - 8 freq gentle (2) - 81 freq giggles (2) - 6 freq jeggie (2) - 1 freq goggles (2) - 10 freq geegly (2) - 1 freq tengle (2) - 1 freq maggle (2) - 1 freq gargle (2) - 3 freq |
geggle (0) - 1 freq goggle (1) - 1 freq giggle (1) - 21 freq gaggle (1) - 5 freq geggie (2) - 17 freq eggle (2) - 2 freq gargle (3) - 3 freq toggle (3) - 1 freq maggle (3) - 1 freq goggles (3) - 10 freq muggle (3) - 4 freq geegly (3) - 1 freq diggle (3) - 1 freq boggle (3) - 1 freq giggles (3) - 6 freq juggle (3) - 1 freq google (3) - 80 freq puggle (3) - 1 freq aggle (3) - 2 freq giggled (3) - 7 freq gurgle (3) - 2 freq raggle (3) - 207 freq geggies (3) - 1 freq geggy (3) - 2 freq gagged (4) - 4 freq |
SoundEx code - G240 gisli - 6 freq 'gisli - 1 freq giggle - 21 freq gaggle - 5 freq google - 80 freq gazelle - 7 freq guzzle - 4 freq goggle - 1 freq geooesel - 1 freq geggle - 1 freq geegly - 1 freq googly - 3 freq gushel - 1 freq gashle - 1 freq gogol - 2 freq €œguzul - 4 freq guzul - 86 freq guzull - 1 freq |
MetaPhone code - JKL giggle - 21 freq jekyll - 14 freq jougle - 1 freq joogle - 6 freq geggle - 1 freq geegly - 1 freq juickly - 1 freq jeekyll - 2 freq jookle - 2 freq jql - 1 freq joogal” - 1 freq jackal - 1 freq juggle - 1 freq |
GEGGLE |
| Time to execute Levenshtein function - 0.228176 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.403768 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.029477 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.039701 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.001098 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. |