| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| earner (0) - 2 freq earned (1) - 19 freq learner (1) - 8 freq warner (1) - 1 freq sorner (2) - 3 freq erne (2) - 4 freq eare (2) - 1 freq eager (2) - 27 freq girner (2) - 1 freq farer (2) - 1 freq larned (2) - 12 freq barter (2) - 3 freq barney (2) - 25 freq barker (2) - 1 freq larners (2) - 10 freq parler (2) - 2 freq ganner (2) - 1 freq dearer (2) - 8 freq learners (2) - 6 freq oarder (2) - 5 freq darker (2) - 9 freq eparnpr (2) - 1 freq yarned (2) - 2 freq horner (2) - 2 freq sarne (2) - 1 freq |
earner (0) - 2 freq rayner (2) - 1 freq warner (2) - 1 freq learner (2) - 8 freq earned (2) - 19 freq earnin (3) - 8 freq mainer (3) - 9 freq eirher (3) - 1 freq launer (3) - 1 freq ernes (3) - 1 freq aaner (3) - 1 freq dauner (3) - 57 freq exoner (3) - 1 freq ebner (3) - 5 freq corner (3) - 324 freq werner (3) - 1 freq earrier (3) - 1 freq coarner (3) - 47 freq awner (3) - 4 freq mariner (3) - 4 freq ainer (3) - 2 freq rarer (3) - 8 freq lairner (3) - 5 freq wauner (3) - 2 freq ecoarner (3) - 1 freq |
SoundEx code - E656 eoarner-na - 1 freq earmarked - 1 freq erm-wrassle - 1 freq earner - 2 freq |
MetaPhone code - ERNR earner - 2 freq |
EARNER |
| Time to execute Levenshtein function - 0.218118 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.388824 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.029427 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.050413 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.001162 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. |