| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| giggled (0) - 7 freq giggle (1) - 21 freq wiggled (1) - 3 freq giggles (1) - 6 freq joggled (2) - 1 freq diggle (2) - 1 freq gagged (2) - 4 freq jigged (2) - 4 freq piggledy (2) - 1 freq singled (2) - 1 freq shiggled (2) - 1 freq rigged (2) - 11 freq nigged (2) - 1 freq gigglan (2) - 1 freq googled (2) - 1 freq goggle (2) - 1 freq eigged (2) - 1 freq higgledy (2) - 1 freq wiggles (2) - 2 freq bigged (2) - 30 freq tingled (2) - 1 freq gigglin (2) - 13 freq gurgled (2) - 3 freq geegled (2) - 2 freq gaggle (2) - 5 freq |
giggled (0) - 7 freq wiggled (2) - 3 freq giggles (2) - 6 freq giggle (2) - 21 freq gigglin (3) - 13 freq geggle (3) - 1 freq higgledy (3) - 1 freq waggled (3) - 2 freq gaggle (3) - 5 freq puggled (3) - 21 freq aggled (3) - 1 freq goggle (3) - 1 freq geegled (3) - 2 freq gurgled (3) - 3 freq gigglan (3) - 1 freq googled (3) - 1 freq piggledy (3) - 1 freq gagged (3) - 4 freq goggles (3) - 10 freq joggled (3) - 1 freq giggilt (4) - 12 freq go-ogled (4) - 1 freq pigged (4) - 1 freq jiggles (4) - 2 freq giggult (4) - 4 freq |
SoundEx code - G243 geegled - 2 freq guzzled - 2 freq giggled - 7 freq giggilt - 12 freq giggult - 4 freq goggle-eed - 1 freq google-eed - 1 freq googled - 1 freq giglets - 1 freq geeglet - 1 freq goswald - 1 freq gigletsreads - 2 freq go-ogled - 1 freq |
MetaPhone code - JKLT geegled - 2 freq joogled - 6 freq giggled - 7 freq giggilt - 12 freq joggled - 1 freq giggult - 4 freq jiggilt - 1 freq jakolet - 1 freq jooglt - 1 freq jooglet - 1 freq geeglet - 1 freq jqliuhd - 1 freq |
GIGGLED |
| Time to execute Levenshtein function - 0.213307 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.367803 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.027532 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.038657 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.000897 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. |