| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| clairer (0) - 1 freq claire (1) - 10 freq claiver (1) - 4 freq clairet (1) - 1 freq cleire (2) - 1 freq chaired (2) - 6 freq lairner (2) - 5 freq cairier (2) - 1 freq laiter (2) - 4 freq carer (2) - 10 freq skairer (2) - 1 freq cairter (2) - 1 freq craiter (2) - 27 freq claret (2) - 8 freq claise (2) - 11 freq claimed (2) - 35 freq clare (2) - 12 freq claer (2) - 22 freq clearer (2) - 26 freq airer (2) - 1 freq shairer (2) - 1 freq slaiver (2) - 1 freq clabber (2) - 13 freq plainer (2) - 3 freq clairts (2) - 1 freq |
clairer (0) - 1 freq clearer (2) - 26 freq clairet (2) - 1 freq claiver (2) - 4 freq claire (2) - 10 freq claer (3) - 22 freq clare (3) - 12 freq claure (3) - 4 freq clair (3) - 56 freq clairin (3) - 1 freq claver (3) - 14 freq eclaire (3) - 1 freq clairt (3) - 5 freq claret (3) - 8 freq clairly (3) - 2 freq clavier (3) - 1 freq cairier (3) - 1 freq clairty (3) - 8 freq cliver (3) - 12 freq carer (3) - 10 freq cleire (3) - 1 freq clarker (3) - 4 freq clarry (3) - 2 freq carrier (4) - 15 freq claart (4) - 1 freq |
SoundEx code - C466 clearer - 26 freq clairer - 1 freq |
MetaPhone code - KLRR clearer - 26 freq clairer - 1 freq |
CLAIRER |
| Time to execute Levenshtein function - 0.208717 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.329977 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.028085 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.037213 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.000917 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. |