| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| epples (0) - 10 freq epple (1) - 13 freq apples (1) - 10 freq epodes (2) - 1 freq poles (2) - 29 freq eccles (2) - 1 freq applees (2) - 3 freq spiles (2) - 1 freq naples (2) - 1 freq ripples (2) - 8 freq exiles (2) - 4 freq pales (2) - 2 freq maples (2) - 1 freq ettles (2) - 79 freq peoples (2) - 11 freq sapples (2) - 2 freq piles (2) - 26 freq applies (2) - 17 freq erles (2) - 1 freq easles (2) - 2 freq cupples (2) - 1 freq applee (2) - 1 freq apple (2) - 32 freq nipples (2) - 7 freq eagles (2) - 11 freq |
epples (0) - 10 freq apples (1) - 10 freq applies (2) - 17 freq peoples (2) - 11 freq applees (2) - 3 freq epple (2) - 13 freq aipples (2) - 91 freq piles (3) - 26 freq sapples (3) - 2 freq applee (3) - 1 freq apple (3) - 32 freq nipples (3) - 7 freq cupples (3) - 1 freq aiples (3) - 4 freq naples (3) - 1 freq spiles (3) - 1 freq ripples (3) - 8 freq poles (3) - 29 freq pales (3) - 2 freq maples (3) - 1 freq peebles (4) - 8 freq aipple (4) - 102 freq pulls (4) - 58 freq appeals (4) - 4 freq purples (4) - 1 freq |
SoundEx code - E142 evils - 4 freq epples - 10 freq eyeballs - 4 freq eeva-liisa - 1 freq epilogue - 2 freq effulgent - 1 freq |
MetaPhone code - EPLS epples - 10 freq |
EPPLES |
| Time to execute Levenshtein function - 0.176811 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.401864 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.030024 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.042416 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.001003 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. |