| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| ear-tae-ear (0) - 1 freq dae-tae-day (4) - 1 freq day-tae-day (4) - 3 freq dear-a-dear (4) - 1 freq parteelcar (5) - 1 freq far-ower-far (5) - 1 freq parteeclar (5) - 101 freq weel-tae-dae (5) - 3 freq parteeklar (5) - 17 freq wa-t-er (5) - 2 freq caretaker (5) - 5 freq easter (6) - 42 freq egalitar-ian (6) - 1 freq carolander (6) - 1 freq traeder (6) - 1 freq parteeclars (6) - 10 freq lap-dancer (6) - 1 freq dot-tae-dot (6) - 2 freq earrier (6) - 1 freq gardener (6) - 2 freq writerer (6) - 3 freq forebear (6) - 3 freq particlar (6) - 30 freq ver-near (6) - 1 freq feardie-baa (6) - 1 freq |
ear-tae-ear (0) - 1 freq wa-t-er (6) - 2 freq dae-tae-day (6) - 1 freq day-tae-day (6) - 3 freq dear-a-dear (7) - 1 freq year-after-year (8) - 1 freq re-appear (8) - 1 freq rae-deer (8) - 1 freq first-year (8) - 5 freq retenar (8) - 1 freq ane-tae-ane (8) - 4 freq fir-tree (8) - 3 freq retailer (8) - 1 freq weel-tae-dae (8) - 3 freq caretaker (8) - 5 freq tartare (9) - 1 freq lear-time (9) - 4 freq darg-year (9) - 1 freq cheetie-eat (9) - 1 freq heart-sair (9) - 1 freq artery (9) - 2 freq tea-table (9) - 1 freq -tree (9) - 1 freq ee-opener (9) - 1 freq free-er (9) - 1 freq |
SoundEx code - E636 ereatures - 1 freq eraitur - 1 freq eraiturs - 1 freq eraiters - 2 freq ear-tae-ear - 1 freq earthworms - 1 freq earthwarks - 2 freq |
MetaPhone code - ERTR eraitur - 1 freq ear-tae-ear - 1 freq |
EAR-TAE-EAR |
| Time to execute Levenshtein function - 0.225844 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.391106 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.028247 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.037509 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.000869 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. |