| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| gable (0) - 8 freq able (1) - 430 freq yable (1) - 7 freq -able (1) - 1 freq gabble (1) - 1 freq gamble (1) - 12 freq cable (1) - 10 freq gabe (1) - 1 freq table (1) - 674 freq gables (1) - 4 freq fable (1) - 8 freq mable (1) - 2 freq galle (1) - 1 freq gablo (1) - 1 freq sable (1) - 2 freq gale (1) - 64 freq coble (2) - 5 freq gibble (2) - 1 freq gaol (2) - 4 freq gabloo (2) - 1 freq table' (2) - 1 freq liable (2) - 4 freq stable (2) - 69 freq gaels (2) - 17 freq gambler (2) - 4 freq |
gable (0) - 8 freq gablo (1) - 1 freq galle (2) - 1 freq mable (2) - 2 freq sable (2) - 2 freq gabloo (2) - 1 freq gbl (2) - 1 freq gabala (2) - 1 freq fable (2) - 8 freq gale (2) - 64 freq gables (2) - 4 freq yable (2) - 7 freq able (2) - 430 freq gabble (2) - 1 freq -able (2) - 1 freq gabe (2) - 1 freq cable (2) - 10 freq gamble (2) - 12 freq table (2) - 674 freq ebble (3) - 1 freq enable (3) - 4 freq gle (3) - 4 freq taeble (3) - 3 freq galley (3) - 4 freq habile (3) - 6 freq |
SoundEx code - G140 gabble - 1 freq gobble - 3 freq gable - 8 freq gavel - 6 freq gabloo - 1 freq gbell - 1 freq gabala - 1 freq gibble - 1 freq gvl - 1 freq gbl - 1 freq gablo - 1 freq |
MetaPhone code - KBL coble - 5 freq gabble - 1 freq gobble - 3 freq gable - 8 freq caybul - 1 freq cable - 10 freq kabul - 1 freq cobble - 5 freq gabloo - 1 freq gbell - 1 freq gabala - 1 freq cabal - 2 freq kibbil - 1 freq qbal - 1 freq kibble - 1 freq gbl - 1 freq kbll - 1 freq gablo - 1 freq |
GABLE |
| Time to execute Levenshtein function - 0.334005 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.558284 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.029059 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.072730 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.000828 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. |