| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| eclaire (0) - 1 freq declaire (1) - 1 freq claire (1) - 10 freq claie (2) - 1 freq clairt (2) - 5 freq claise (2) - 11 freq clair (2) - 56 freq 'claire' (2) - 1 freq elvire (2) - 4 freq clairet (2) - 1 freq cleire (2) - 1 freq declare (2) - 25 freq clare (2) - 12 freq elaine (2) - 12 freq claure (2) - 4 freq clairer (2) - 1 freq malaise (3) - 1 freq claiver (3) - 4 freq lairt (3) - 5 freq clairtie (3) - 2 freq faire (3) - 1 freq clairin (3) - 1 freq schare (3) - 1 freq claick (3) - 1 freq clais (3) - 2 freq |
eclaire (0) - 1 freq claire (1) - 10 freq cleire (2) - 1 freq claure (2) - 4 freq clair (2) - 56 freq clare (2) - 12 freq declaire (2) - 1 freq claise (3) - 11 freq cleir (3) - 3 freq colair (3) - 1 freq clere (3) - 3 freq claer (3) - 22 freq claie (3) - 1 freq clairer (3) - 1 freq clara (3) - 9 freq clure (3) - 1 freq clairet (3) - 1 freq clairt (3) - 5 freq declare (3) - 25 freq coloure (4) - 1 freq blare (4) - 3 freq clime (4) - 7 freq clize (4) - 2 freq cler (4) - 1 freq lire (4) - 2 freq |
SoundEx code - E246 eclaire - 1 freq 'escalier - 1 freq exhilaration - 1 freq eazkqialrj - 1 freq |
MetaPhone code - EKLR eclaire - 1 freq |
ECLAIRE |
| Time to execute Levenshtein function - 0.221861 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.383564 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.029069 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.043622 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.000931 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. |