Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
---|---|---|---|---|
gbqlw (0) - 1 freq gbell (2) - 1 freq qlw (2) - 1 freq girlw (2) - 1 freq gbl (2) - 1 freq grow (3) - 151 freq gablo (3) - 1 freq mbtw (3) - 1 freq gruw (3) - 3 freq gabble (3) - 1 freq cbqc (3) - 1 freq fqw (3) - 1 freq below (3) - 86 freq bqdv (3) - 1 freq ebble (3) - 1 freq blew (3) - 117 freq gisli (3) - 6 freq biow (3) - 1 freq baw (3) - 132 freq pbl (3) - 1 freq gilli (3) - 3 freq byle (3) - 16 freq buls (3) - 1 freq bal (3) - 6 freq geelt (3) - 2 freq |
gbqlw (0) - 1 freq gbell (4) - 1 freq girlw (4) - 1 freq gbl (4) - 1 freq qlw (4) - 1 freq blow (5) - 51 freq ablow (5) - 336 freq 'blaw (5) - 2 freq glaw (5) - 2 freq glow (5) - 51 freq abilow (5) - 7 freq belaw (5) - 1 freq gsalaw (5) - 1 freq blaw (5) - 200 freq gable (5) - 8 freq bylaw (5) - 1 freq gabblt (5) - 1 freq ablaw (5) - 10 freq gobble (5) - 3 freq gabala (5) - 1 freq gibble (5) - 1 freq ab'low (5) - 1 freq gablo (5) - 1 freq blew (5) - 117 freq below (5) - 86 freq |
SoundEx code - G124 gippsland - 1 freq gsfwswljwd - 1 freq goevaazcld - 1 freq gbqlw - 1 freq gwfqioihlb - 1 freq |
MetaPhone code - KBKL cubicle - 9 freq cubical - 2 freq gbqlw - 1 freq |
GBQLW |
Time to execute Levenshtein function - 0.187090 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.330578 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.027696 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.037928 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.000935 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. |