| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| cowdenbeath (0) - 8 freq cowdenbeith (1) - 1 freq covereth (5) - 1 freq underneath (5) - 22 freq cbeath (5) - 1 freq lowdent (5) - 1 freq condenser (5) - 1 freq owerreach (5) - 1 freq beneath (5) - 35 freq commentate (5) - 1 freq coinneach (5) - 1 freq convenient (5) - 5 freq commonwealth (5) - 5 freq doonbeat (5) - 1 freq condense (5) - 2 freq cowden (5) - 7 freq condensed (5) - 5 freq compensate (5) - 2 freq consentet (5) - 1 freq concentrate (5) - 33 freq uisge-beatha (6) - 1 freq osteopath (6) - 3 freq convenience (6) - 3 freq commence (6) - 4 freq moonbeam (6) - 1 freq |
cowdenbeath (0) - 8 freq cowdenbeith (1) - 1 freq doonbeat (8) - 1 freq lowdent (8) - 1 freq cbeath (8) - 1 freq cowden (8) - 7 freq clingeth (9) - 1 freq bloodbath (9) - 1 freq carnwath (9) - 3 freq twentieth (9) - 9 freq condensation (9) - 2 freq mud-bath (9) - 1 freq sawbath (9) - 1 freq consentet (9) - 1 freq dunteth (9) - 1 freq warbeth (9) - 1 freq compensate (9) - 2 freq coordinate (9) - 2 freq beneath (9) - 35 freq condenser (9) - 1 freq underneath (9) - 22 freq covereth (9) - 1 freq commentate (9) - 1 freq coinneach (9) - 1 freq condense (9) - 2 freq |
SoundEx code - C351 cowdenbeath - 8 freq catnip - 2 freq cowdenbeith - 1 freq |
MetaPhone code - KTNB0 cowdenbeath - 8 freq cowdenbeith - 1 freq |
COWDENBEATH |
| Time to execute Levenshtein function - 0.207325 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.394686 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.027064 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.037972 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.000913 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. |