| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| gubbins (0) - 3 freq gubbin (1) - 3 freq gobbins (1) - 3 freq gibbons (2) - 2 freq rubbing (2) - 3 freq wudbins (2) - 1 freq dubbin (2) - 1 freq rubbin (2) - 48 freq gabbin (2) - 19 freq gebbies (2) - 1 freq rubbits (2) - 14 freq guidins (2) - 1 freq goblins (2) - 1 freq siblins (3) - 10 freq puffins (3) - 5 freq bubbles (3) - 23 freq gobbs (3) - 20 freq abins (3) - 1 freq butlins (3) - 1 freq bins (3) - 32 freq turbines (3) - 3 freq nabbin (3) - 2 freq nebbin (3) - 1 freq guysin (3) - 7 freq gibbous (3) - 2 freq |
gubbins (0) - 3 freq gobbins (1) - 3 freq gubbin (2) - 3 freq gibbons (2) - 2 freq gabbin (3) - 19 freq goblins (3) - 1 freq gebbies (3) - 1 freq gobban (4) - 1 freq gibbous (4) - 2 freq gabbana (4) - 1 freq gibbles (4) - 1 freq ribbons (4) - 31 freq gibbon's (4) - 1 freq gobbs (4) - 20 freq gibbon (4) - 10 freq ribbans (4) - 1 freq rubbin (4) - 48 freq dubbin (4) - 1 freq wudbins (4) - 1 freq rubbing (4) - 3 freq guidins (4) - 1 freq rubbits (4) - 14 freq gratins (5) - 1 freq geebies (5) - 1 freq turbans (5) - 1 freq |
SoundEx code - G152 giving - 25 freq govan's - 1 freq gibbon's - 1 freq gobbins - 3 freq gavin's - 3 freq gvangs - 1 freq gibbons - 2 freq gowpens - 1 freq gowpins - 1 freq guffawing - 1 freq €œgiving - 1 freq gbinac - 1 freq gyping - 1 freq gxbvmkxap - 1 freq govanstones - 11 freq gubbins - 3 freq gbmkvbto - 1 freq gavinmackay - 1 freq giovansouness - 1 freq gbmicxn - 1 freq gebpnzubl - 1 freq govanscotsweek - 7 freq giffnockprimary - 1 freq |
MetaPhone code - KBNS cabons - 1 freq cabins - 2 freq gobbins - 3 freq gubbins - 3 freq |
GUBBINS |
| Time to execute Levenshtein function - 0.183769 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.347102 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.027392 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.036813 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.000772 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. |