| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| eucalyptus (0) - 1 freq clytus (4) - 2 freq escalates (4) - 1 freq exalts (5) - 1 freq accolytes (5) - 1 freq macalps (5) - 1 freq cactus (5) - 2 freq excalibur (5) - 1 freq captur (5) - 1 freq caiptur (5) - 1 freq scalpels (5) - 1 freq sclytes (5) - 1 freq callets (5) - 1 freq escalator (5) - 4 freq escalate (5) - 3 freq sculpturs (5) - 3 freq acarpous (5) - 1 freq enceladus (5) - 1 freq calgacus (5) - 3 freq escapes (5) - 4 freq cbcalerts (5) - 1 freq egypt's (5) - 1 freq excepturs (5) - 1 freq calcagus (5) - 1 freq cyprus (5) - 7 freq |
eucalyptus (0) - 1 freq clytus (5) - 2 freq calypso (6) - 1 freq callets (6) - 1 freq acolytes (6) - 1 freq ecliptic (6) - 1 freq escalates (6) - 1 freq coalpits (6) - 1 freq cantus (7) - 1 freq claps (7) - 5 freq nicolytes (7) - 1 freq callous (7) - 2 freq sculptur (7) - 1 freq scalp's (7) - 1 freq clats (7) - 1 freq campus (7) - 5 freq apocalyptic (7) - 6 freq cairpets (7) - 7 freq accepts (7) - 6 freq clouts (7) - 8 freq celts (7) - 9 freq clarts (7) - 2 freq carpets (7) - 8 freq clauts (7) - 4 freq claypotts (7) - 8 freq |
SoundEx code - E241 excalibur - 1 freq eclipse - 5 freq equilibrium - 5 freq eclipsed - 2 freq ex-leftie - 1 freq eucalyptus - 1 freq ecliptic - 1 freq ex-yolewife - 1 freq esclopé - 1 freq exlpid - 1 freq essqloubl - 1 freq ecleivox - 1 freq |
MetaPhone code - EKLPTS eucalyptus - 1 freq |
EUCALYPTUS |
| Time to execute Levenshtein function - 0.188148 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.409834 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.032850 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.039342 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.000951 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. |