| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| goblins (0) - 1 freq gobbins (1) - 3 freq gorblins (1) - 1 freq goblin (1) - 9 freq gosling (2) - 1 freq gubbins (2) - 3 freq collins (2) - 3 freq aiblins (2) - 282 freq gowlin (2) - 15 freq gorblin's (2) - 1 freq gorblin (2) - 2 freq gobbling (2) - 1 freq siblins (2) - 10 freq yorlins (2) - 3 freq godlin (2) - 1 freq yiblins (2) - 1 freq codlins (2) - 4 freq gowpins (2) - 1 freq robins (2) - 1 freq gobblin (2) - 1 freq norlins (2) - 1 freq goslings (2) - 1 freq ootlins (2) - 3 freq goins (2) - 2 freq gowls (3) - 2 freq |
goblins (0) - 1 freq goblin (2) - 9 freq gorblins (2) - 1 freq gobbins (2) - 3 freq aiblins (3) - 282 freq yiblins (3) - 1 freq siblins (3) - 10 freq gubbins (3) - 3 freq 'aiblins (4) - 8 freq goins (4) - 2 freq ootlins (4) - 3 freq gallons (4) - 14 freq gillians (4) - 1 freq gables (4) - 4 freq blens (4) - 1 freq gablos (4) - 1 freq giblets (4) - 1 freq aiblains (4) - 3 freq glens (4) - 44 freq goslings (4) - 1 freq gibbons (4) - 2 freq gobblin (4) - 1 freq gorblin (4) - 2 freq gobbling (4) - 1 freq yorlins (4) - 3 freq |
SoundEx code - G145 gable-end - 1 freq gabblin - 4 freq gavel-en - 2 freq gable-en - 2 freq gable-ens - 1 freq goblins - 1 freq gobblin - 1 freq goblin - 9 freq gobbling - 1 freq gabbling - 1 freq gboylandjkd - 1 freq gblenrkdla - 1 freq |
MetaPhone code - KBLNS gable-ens - 1 freq goblins - 1 freq |
GOBLINS |
| Time to execute Levenshtein function - 0.180178 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.335404 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.027263 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.037193 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.000913 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. |