| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| cottonwid (0) - 1 freq cottonweed (2) - 1 freq cottown (3) - 1 freq cotton-woo (3) - 2 freq cotton (3) - 25 freq componit (4) - 1 freq coontie (4) - 8 freq motioned (4) - 1 freq cowid (4) - 3 freq contortit (4) - 2 freq commontie (4) - 2 freq notioned (4) - 1 freq rottid (4) - 1 freq coovid (4) - 1 freq motorwiy (4) - 2 freq contenin (4) - 1 freq contented (4) - 8 freq continewit (4) - 1 freq contened (4) - 1 freq condoned (4) - 1 freq continued (4) - 69 freq compoondid (4) - 1 freq contined (4) - 4 freq roondid (4) - 1 freq boorwid (4) - 1 freq |
cottonwid (0) - 1 freq cottonweed (2) - 1 freq cotton-woo (5) - 2 freq cotton (5) - 25 freq cottown (5) - 1 freq contined (6) - 4 freq continued (6) - 69 freq contened (6) - 1 freq continewit (6) - 1 freq gattonside (6) - 1 freq buttoned (6) - 11 freq contented (6) - 8 freq contineed (6) - 1 freq cottared (6) - 5 freq contend (6) - 4 freq conteenyed (7) - 5 freq contenin (7) - 1 freq conteenwal (7) - 1 freq steenywid (7) - 1 freq cuttance (7) - 7 freq syttand (7) - 1 freq conteined (7) - 2 freq conteenued (7) - 1 freq cutting (7) - 16 freq componed (7) - 2 freq |
SoundEx code - C353 cottonwid - 1 freq cottonweed - 1 freq |
MetaPhone code - KTNWT cottonwid - 1 freq cottonweed - 1 freq |
COTTONWID |
| Time to execute Levenshtein function - 0.229150 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.390097 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.031844 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.042475 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.000888 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. |