| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| earnest (0) - 13 freq ernest (1) - 6 freq erest (2) - 10 freq earnestly (2) - 4 freq fardest (2) - 4 freq dearest (2) - 19 freq largest (2) - 4 freq barnes (2) - 5 freq earner (2) - 2 freq warmest (2) - 5 freq garnet (2) - 1 freq eares (2) - 1 freq hanest (2) - 1 freq nearest (2) - 64 freq hardest (2) - 17 freq harvest (2) - 14 freq earliest (2) - 19 freq darkest (2) - 14 freq meanest (2) - 1 freq ernes (2) - 1 freq damnest (2) - 1 freq firnest (2) - 1 freq narrest (2) - 6 freq harnesh (2) - 1 freq barnett (2) - 1 freq |
earnest (0) - 13 freq ernest (1) - 6 freq airnest (2) - 2 freq firnest (3) - 1 freq earliest (3) - 19 freq meanest (3) - 1 freq rarest (3) - 4 freq earnt (3) - 10 freq arrest (3) - 9 freq hanest (3) - 1 freq earns (3) - 3 freq ernes (3) - 1 freq earnestly (3) - 4 freq erest (3) - 10 freq euaneast (4) - 1 freq nest (4) - 81 freq reest (4) - 11 freq finest (4) - 59 freq soonest (4) - 1 freq erst (4) - 5 freq fynest (4) - 1 freq anenst (4) - 52 freq aganest (4) - 2 freq rest (4) - 683 freq aranese (4) - 1 freq |
SoundEx code - E652 earrins - 2 freq erying - 1 freq erms - 42 freq ermchair - 10 freq earnestly - 4 freq earrings - 7 freq eerins - 6 freq earnest - 13 freq ernest - 6 freq eerin's - 1 freq errins - 1 freq earns - 3 freq erns - 1 freq ee-wharms - 1 freq ern-cairriers - 1 freq erin's - 3 freq ernie's - 2 freq erm-chair - 1 freq eernest-like - 1 freq erne's - 1 freq euromosaic - 1 freq eerans - 1 freq ernes - 1 freq eringrieve - 7 freq eerrans - 1 freq |
MetaPhone code - ERNST earnest - 13 freq ernest - 6 freq |
EARNEST |
| Time to execute Levenshtein function - 0.504039 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.904522 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.087667 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.097126 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.001108 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. |