| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| ernest (0) - 6 freq ernes (1) - 1 freq earnest (1) - 13 freq erest (1) - 10 freq hervest (2) - 10 freq erne's (2) - 1 freq eldest (2) - 18 freq rerrest (2) - 1 freq erne (2) - 4 freq erliest (2) - 1 freq 'onest (2) - 1 freq erles (2) - 1 freq merest (2) - 6 freq eines (2) - 3 freq erns (2) - 1 freq reest (2) - 11 freq priest (2) - 39 freq rest (2) - 683 freq breest (2) - 23 freq brest (2) - 1 freq freest (2) - 1 freq eries (2) - 1 freq crest (2) - 7 freq erses (2) - 23 freq ternent (2) - 1 freq |
ernest (0) - 6 freq earnest (1) - 13 freq ernes (2) - 1 freq airnest (2) - 2 freq erest (2) - 10 freq erns (3) - 1 freq finest (3) - 59 freq reest (3) - 11 freq keenest (3) - 1 freq nest (3) - 81 freq meanest (3) - 1 freq rest (3) - 683 freq 'onest (3) - 1 freq fynest (3) - 1 freq hanest (3) - 1 freq arrest (3) - 9 freq erst (3) - 5 freq firnest (3) - 1 freq erliest (3) - 1 freq honest (3) - 190 freq rarest (4) - 4 freq wneist (4) - 1 freq unst (4) - 12 freq aganest (4) - 2 freq 'nesty (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 |
ERNEST |
| Time to execute Levenshtein function - 0.192635 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.351698 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.027134 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.037070 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.000848 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. |