Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
---|---|---|---|---|
cobwebs (0) - 12 freq cobwabs (1) - 2 freq cobweb (1) - 1 freq cobles (2) - 2 freq cower (3) - 11 freq jowes (3) - 5 freq lowers (3) - 6 freq dowers (3) - 1 freq coppers (3) - 9 freq nobles (3) - 7 freq covers (3) - 50 freq bowels (3) - 9 freq coqwdqs (3) - 1 freq objeks (3) - 3 freq cowps (3) - 8 freq cables (3) - 6 freq towes (3) - 6 freq comers (3) - 1 freq cobler (3) - 1 freq cubes (3) - 7 freq jobless (3) - 1 freq compels (3) - 1 freq rowes (3) - 10 freq cowert (3) - 2 freq combs (3) - 6 freq |
cobwebs (0) - 12 freq cobwabs (1) - 2 freq cobweb (2) - 1 freq cobles (4) - 2 freq cobbis (4) - 1 freq blebs (5) - 1 freq celebs (5) - 4 freq bowers (5) - 1 freq corbies (5) - 20 freq cbeebies (5) - 1 freq cobs (5) - 1 freq cowie's (5) - 2 freq cowks (5) - 1 freq chebs (5) - 3 freq cobbles (5) - 10 freq cabers (5) - 4 freq cows (5) - 5 freq webs (5) - 2 freq bowes (5) - 1 freq cabbies (5) - 1 freq cow's (5) - 2 freq gobbs (5) - 20 freq cobwebbed (5) - 1 freq biebs (5) - 1 freq cowboys (5) - 3 freq |
SoundEx code - C112 cobwebs - 12 freq cobwabs - 2 freq cbeebies - 1 freq |
MetaPhone code - KBWBS cobwebs - 12 freq cobwabs - 2 freq |
COBWEBS |
Time to execute Levenshtein function - 0.209061 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.373414 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.028348 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.038624 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.000846 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. |