| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| clearer (0) - 26 freq cleared (1) - 56 freq cleaver (1) - 4 freq cleaner (1) - 31 freq carer (2) - 10 freq pleurer (2) - 1 freq clere (2) - 3 freq clearit (2) - 2 freq clever (2) - 66 freq clearest (2) - 4 freq shearer (2) - 4 freq bleared (2) - 7 freq clearan (2) - 2 freq cleaved (2) - 2 freq clear (2) - 486 freq cheater (2) - 1 freq cleaves (2) - 1 freq nearer (2) - 72 freq clear's (2) - 1 freq sleater (2) - 1 freq clears (2) - 19 freq leader (2) - 58 freq cleire (2) - 1 freq cleary (2) - 1 freq clarker (2) - 4 freq |
clearer (0) - 26 freq clairer (2) - 1 freq cleaner (2) - 31 freq cleared (2) - 56 freq cleaver (2) - 4 freq claer (3) - 22 freq clearly (3) - 140 freq cleire (3) - 1 freq cleer (3) - 6 freq cleary (3) - 1 freq clarker (3) - 4 freq cloaser (3) - 5 freq claret (3) - 8 freq clarry (3) - 2 freq clearin (3) - 27 freq claver (3) - 14 freq clare (3) - 12 freq clears (3) - 19 freq cleart (3) - 9 freq cleverer (3) - 1 freq clever (3) - 66 freq clearan (3) - 2 freq clere (3) - 3 freq pleurer (3) - 1 freq carer (3) - 10 freq |
SoundEx code - C466 clearer - 26 freq clairer - 1 freq |
MetaPhone code - KLRR clearer - 26 freq clairer - 1 freq |
CLEARER |
| Time to execute Levenshtein function - 0.226963 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.448548 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.029294 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.040051 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.001059 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. |