| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| earned (0) - 19 freq darned (1) - 2 freq warned (1) - 36 freq learned (1) - 79 freq earner (1) - 2 freq larned (1) - 12 freq yarned (1) - 2 freq harned (1) - 3 freq aaned (2) - 1 freq carved (2) - 22 freq yarked (2) - 9 freq warner (2) - 1 freq dawned (2) - 14 freq worned (2) - 1 freq barnet (2) - 3 freq awned (2) - 27 freq airned (2) - 1 freq cared (2) - 34 freq pained (2) - 1 freq wared (2) - 9 freq armed (2) - 18 freq erne (2) - 4 freq girned (2) - 33 freq vaned (2) - 1 freq barked (2) - 9 freq |
earned (0) - 19 freq yarned (1) - 2 freq harned (2) - 3 freq airned (2) - 1 freq darned (2) - 2 freq rained (2) - 13 freq learned (2) - 79 freq larned (2) - 12 freq warned (2) - 36 freq earner (2) - 2 freq herned (3) - 1 freq gurned (3) - 1 freq mauned (3) - 1 freq derned (3) - 5 freq burned (3) - 32 freq arne (3) - 1 freq ersed (3) - 6 freq purned (3) - 1 freq earns (3) - 3 freq earnt (3) - 10 freq yaaned (3) - 4 freq horned (3) - 2 freq maned (3) - 2 freq corned (3) - 8 freq lairned (3) - 14 freq |
SoundEx code - E653 earned - 19 freq errants - 4 freq earnt - 10 freq errand - 5 freq earrant - 1 freq errands - 11 freq eraandmidder - 1 freq eerant - 2 freq errant - 2 freq eerrant - 1 freq eerant-louns - 1 freq erintz - 1 freq |
MetaPhone code - ERNT earned - 19 freq earnt - 10 freq errand - 5 freq earrant - 1 freq eerant - 2 freq errant - 2 freq eerrant - 1 freq |
EARNED |
| Time to execute Levenshtein function - 0.237436 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.430661 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.029832 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.042114 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.001038 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. |