| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| giblets (0) - 1 freq giglets (1) - 1 freq gimlets (1) - 1 freq gibbet (2) - 5 freq gables (2) - 4 freq bibles (2) - 6 freq billets (2) - 3 freq gibblet (2) - 1 freq fillets (2) - 3 freq gimlet (2) - 1 freq goblet (2) - 1 freq giles (2) - 9 freq violets (2) - 16 freq tablets (2) - 7 freq gisless (2) - 1 freq gibbles (2) - 1 freq giless (2) - 4 freq piles (3) - 26 freq nibbles (3) - 2 freq titlet (3) - 1 freq oolets (3) - 1 freq gullet (3) - 5 freq giled (3) - 1 freq gadjets (3) - 1 freq gives (3) - 20 freq |
giblets (0) - 1 freq gimlets (2) - 1 freq giglets (2) - 1 freq goblet (3) - 1 freq tablets (3) - 7 freq gables (3) - 4 freq gisless (4) - 1 freq gibbles (4) - 1 freq bleats (4) - 1 freq gablos (4) - 1 freq violets (4) - 16 freq giless (4) - 4 freq goblins (4) - 1 freq billets (4) - 3 freq bibles (4) - 6 freq gibbet (4) - 5 freq gibblet (4) - 1 freq fillets (4) - 3 freq giles (4) - 9 freq gimlet (4) - 1 freq glents (5) - 6 freq ambles (5) - 2 freq 'violets (5) - 1 freq chalets (5) - 1 freq gets (5) - 432 freq |
SoundEx code - G143 gabblt - 1 freq gabbled - 1 freq goblet - 1 freq gobbled - 4 freq gobbledegook - 1 freq giblets - 1 freq gobble-it-up - 1 freq geopolitical - 1 freq gibblet - 1 freq gabblet - 1 freq gfylt - 1 freq |
MetaPhone code - JBLTS giblets - 1 freq |
GIBLETS |
| Time to execute Levenshtein function - 0.226400 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.372182 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.035475 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.040431 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.001226 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. |