| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| gablos (0) - 1 freq gablo (1) - 1 freq gables (1) - 4 freq gabloo (1) - 1 freq gallop (2) - 12 freq gales (2) - 12 freq pablo (2) - 2 freq fables (2) - 10 freq cables (2) - 6 freq gallons (2) - 14 freq gambles (2) - 2 freq 'ablow (2) - 1 freq gallous (2) - 1 freq gals (2) - 2 freq gaels (2) - 17 freq ablo (2) - 135 freq gallus (2) - 97 freq sablon (2) - 1 freq gabs (2) - 3 freq carlos (2) - 3 freq tables (2) - 84 freq gable (2) - 8 freq galas (2) - 1 freq gallas (2) - 1 freq wanlos (2) - 1 freq |
gablos (0) - 1 freq gables (1) - 4 freq gabloo (2) - 1 freq gablo (2) - 1 freq tables (3) - 84 freq gallus (3) - 97 freq gable (3) - 8 freq gaels (3) - 17 freq gallas (3) - 1 freq nables (3) - 1 freq gauls (3) - 2 freq gals (3) - 2 freq galas (3) - 1 freq gabs (3) - 3 freq gallous (3) - 1 freq cables (3) - 6 freq fables (3) - 10 freq gambles (3) - 2 freq gales (3) - 12 freq gillis (4) - 1 freq gabala (4) - 1 freq bales (4) - 17 freq cabals (4) - 4 freq rabels (4) - 1 freq agalis (4) - 1 freq |
SoundEx code - G142 gables - 4 freq gibbles - 1 freq gibble-gabble - 2 freq gibbil-gabbil - 1 freq gablos - 1 freq gfvluxgiw - 1 freq gòbhlag - 1 freq |
MetaPhone code - KBLS cobbles - 10 freq gables - 4 freq cables - 6 freq kæbils - 1 freq cobles - 2 freq cabals - 4 freq gablos - 1 freq |
GABLOS |
| Time to execute Levenshtein function - 0.237220 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.357583 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.028309 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.038923 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.000889 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. |