| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| epple-tree (0) - 1 freq epple-trees (1) - 1 freq aiple-tree (2) - 1 freq aipple-tree (2) - 1 freq empie-free (3) - 1 freq dule-tree (3) - 1 freq expletive (4) - 1 freq epicentres (4) - 1 freq epicentre (4) - 2 freq lime-tree (4) - 1 freq rose-tree (4) - 18 freq tail-tree (4) - 1 freq ex-leftie (5) - 1 freq palestine (5) - 4 freq €œpetrie (5) - 3 freq plane-trees (5) - 1 freq spleetry (5) - 8 freq povertee (5) - 1 freq pale-pale (5) - 1 freq electron (5) - 1 freq rosetree (5) - 1 freq plester (5) - 2 freq lettres (5) - 1 freq extree (5) - 1 freq expleits (5) - 1 freq |
epple-tree (0) - 1 freq epple-trees (2) - 1 freq aipple-tree (2) - 1 freq aiple-tree (3) - 1 freq dule-tree (5) - 1 freq tail-tree (6) - 1 freq empie-free (6) - 1 freq planetree (7) - 1 freq plester (7) - 2 freq appletizer (7) - 2 freq spleuter (7) - 3 freq spleetry (7) - 8 freq pleuter (7) - 1 freq spleuterie (7) - 1 freq pleiter (7) - 1 freq epicentre (7) - 2 freq expletive (7) - 1 freq lime-tree (7) - 1 freq rose-tree (7) - 18 freq daith-tree (8) - 1 freq palestyne (8) - 1 freq explore (8) - 28 freq portree (8) - 1 freq pleated (8) - 5 freq plooter (8) - 1 freq |
SoundEx code - E143 epple-tree - 1 freq evolution - 10 freq evaluate - 1 freq e-bulletin - 1 freq epple-trees - 1 freq evaluation - 3 freq evaluated - 3 freq evaluatin' - 1 freq e-bluidy-nough - 1 freq evolutions - 1 freq |
MetaPhone code - EPLTR epple-tree - 1 freq |
EPPLE-TREE |
| Time to execute Levenshtein function - 0.247212 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.418704 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.028170 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.037963 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.000878 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. |