| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| gimlet (0) - 1 freq gimlets (1) - 1 freq billet (2) - 1 freq gibblet (2) - 1 freq bilet (2) - 3 freq inlet (2) - 1 freq giblets (2) - 1 freq titlet (2) - 1 freq limpet (2) - 5 freq pilet (2) - 1 freq gibbet (2) - 5 freq gullet (2) - 5 freq jillet (2) - 2 freq filet (2) - 2 freq simmet (2) - 3 freq pielet (2) - 2 freq gimme (2) - 4 freq hamlet (2) - 10 freq fillet (2) - 7 freq gimmer (2) - 2 freq giglets (2) - 1 freq giles (2) - 9 freq goblet (2) - 1 freq gilt (2) - 2 freq violet (2) - 316 freq |
gimlet (0) - 1 freq gimlets (2) - 1 freq goblet (3) - 1 freq gilt (3) - 2 freq hamlet (3) - 10 freq gullet (3) - 5 freq gymkit (4) - 1 freq guelt (4) - 1 freq giltee (4) - 2 freq smilet (4) - 19 freq jumlit (4) - 2 freq gumlier (4) - 1 freq glit (4) - 1 freq gamut (4) - 1 freq gemmelt (4) - 1 freq gelt (4) - 1 freq glt (4) - 1 freq gullt (4) - 1 freq gealt (4) - 3 freq glut (4) - 5 freq gemiler (4) - 3 freq galt (4) - 6 freq eaglet (4) - 14 freq geelit (4) - 1 freq geeglet (4) - 1 freq |
SoundEx code - G543 gimlets - 1 freq gemmelt - 1 freq gunnel-deep - 1 freq gammeldans - 1 freq gimlet - 1 freq |
MetaPhone code - JMLT jumblt - 1 freq jumbelt - 1 freq gemmelt - 1 freq jumbled - 2 freq jumlit - 2 freq jummled - 1 freq gimlet - 1 freq |
GIMLET |
| Time to execute Levenshtein function - 0.304409 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.589666 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.027400 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.070137 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.000846 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. |