| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| cobwebs (0) - 12 freq cobwabs (1) - 2 freq cobweb (1) - 1 freq cobles (2) - 2 freq cobs (3) - 1 freq compels (3) - 1 freq cosies (3) - 1 freq coke's (3) - 1 freq howes (3) - 18 freq coshes (3) - 1 freq rowers (3) - 3 freq corsets (3) - 2 freq corsels (3) - 1 freq obes (3) - 1 freq vowels (3) - 22 freq fobie's (3) - 1 freq coppers (3) - 9 freq rowes (3) - 10 freq cowsers (3) - 1 freq cubes (3) - 12 freq lowers (3) - 7 freq bowers (3) - 1 freq coffees (3) - 1 freq cobwebbed (3) - 1 freq jobless (3) - 1 freq |
cobwebs (0) - 12 freq cobwabs (1) - 2 freq cobweb (2) - 1 freq cobbis (4) - 1 freq cobles (4) - 2 freq combs (5) - 7 freq celebs (5) - 4 freq webs (5) - 2 freq corbies (5) - 20 freq cobwebbed (5) - 1 freq bowels (5) - 9 freq cobs (5) - 1 freq cowks (5) - 1 freq cowps (5) - 8 freq cowboys (5) - 3 freq blebs (5) - 1 freq cobbles (5) - 10 freq bowers (5) - 1 freq cows (5) - 5 freq cow's (5) - 2 freq cowie's (5) - 2 freq gobbs (5) - 20 freq bowes (5) - 1 freq cbeebies (5) - 1 freq cabbies (5) - 1 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.190917 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.365393 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.027346 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.047042 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.000933 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. |