| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| eppatite (0) - 1 freq appetite (2) - 19 freq petite (3) - 1 freq expatriate (3) - 1 freq eatit (3) - 1 freq opposite (3) - 89 freq oappasite (3) - 1 freq platie (3) - 2 freq updatit (3) - 13 freq appetites (3) - 2 freq elatit (3) - 1 freq repeatit (3) - 52 freq hematite (3) - 1 freq emptie (3) - 1 freq empathise (3) - 4 freq pratie (3) - 1 freq emptit (3) - 1 freq praties (4) - 2 freq endytit (4) - 1 freq practice (4) - 109 freq pottit (4) - 3 freq pepperie (4) - 1 freq equalise (4) - 4 freq equation (4) - 5 freq uppance (4) - 1 freq |
eppatite (0) - 1 freq appetite (2) - 19 freq repeatit (4) - 52 freq appetites (4) - 2 freq emptit (4) - 1 freq oappasite (4) - 1 freq updatit (4) - 13 freq petite (4) - 1 freq opposite (4) - 89 freq geppetto (5) - 1 freq appiteits (5) - 1 freq appearit (5) - 5 freq repaitit (5) - 5 freq plotit (5) - 3 freq pintit (5) - 14 freq puttit (5) - 1 freq pitit (5) - 5 freq putit (5) - 2 freq uppity (5) - 6 freq repetit (5) - 1 freq ppokit (5) - 1 freq postit (5) - 13 freq pratta (5) - 1 freq partit (5) - 4 freq pettie (5) - 1 freq |
SoundEx code - E133 evitit - 2 freq evytit - 1 freq eftitnune - 1 freq epithet - 2 freq evaded - 1 freq eppatite - 1 freq |
MetaPhone code - EPTT eppatite - 1 freq |
EPPATITE |
| Time to execute Levenshtein function - 0.369233 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.506238 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.027570 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.071245 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.001011 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. |