| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| cleland (0) - 7 freq clelland (1) - 2 freq cland (2) - 1 freq cleveland (2) - 1 freq copland (2) - 6 freq eland (2) - 1 freq fleand (2) - 2 freq copeland (2) - 1 freq heeland (2) - 1 freq alexand (2) - 2 freq cleaned (2) - 35 freq cleant (2) - 4 freq cleane (2) - 1 freq clean (2) - 356 freq iceland (2) - 42 freq yreland (2) - 1 freq hieland (2) - 16 freq zeeland (2) - 1 freq ireland (2) - 145 freq slepand (2) - 1 freq cleans (2) - 9 freq leman (3) - 3 freq fleean (3) - 7 freq cleshed (3) - 1 freq clang (3) - 12 freq |
cleland (0) - 7 freq clelland (2) - 2 freq cleaned (3) - 35 freq iceland (3) - 42 freq copeland (3) - 1 freq copland (3) - 6 freq cleveland (3) - 1 freq zeeland (4) - 1 freq hieland (4) - 16 freq holland (4) - 17 freq ireland (4) - 145 freq cleans (4) - 9 freq callan (4) - 3 freq yreland (4) - 1 freq callant (4) - 21 freq slepand (4) - 1 freq cland (4) - 1 freq eland (4) - 1 freq fleand (4) - 2 freq heeland (4) - 1 freq alexand (4) - 2 freq cleane (4) - 1 freq clean (4) - 356 freq cleant (4) - 4 freq upland (5) - 5 freq |
SoundEx code - C445 cleland - 7 freq clelland - 2 freq clelandpsych - 1 freq |
MetaPhone code - KLLNT cleland - 7 freq clelland - 2 freq |
CLELAND |
| Time to execute Levenshtein function - 0.228933 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.367350 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.028065 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.039284 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.000943 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. |