| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| ebner (0) - 5 freq einer (1) - 1 freq eber (1) - 3 freq eser (2) - 1 freq denner (2) - 273 freq etter (2) - 2 freq elmer (2) - 2 freq eer (2) - 192 freq aaner (2) - 1 freq ooner (2) - 2 freq eine (2) - 1 freq tenner (2) - 25 freq henner (2) - 3 freq lner (2) - 1 freq baer (2) - 2 freq weber (2) - 1 freq tuner (2) - 1 freq efler (2) - 1 freq ber (2) - 4 freq hefner (2) - 1 freq unner (2) - 461 freq deener (2) - 3 freq einen (2) - 1 freq suner (2) - 3 freq diner (2) - 1 freq |
ebner (0) - 5 freq eber (2) - 3 freq einer (2) - 1 freq siner (3) - 1 freq keener (3) - 6 freq ueber (3) - 1 freq liner (3) - 4 freq earner (3) - 2 freq uner (3) - 2 freq beer (3) - 142 freq finer (3) - 14 freq ner (3) - 53 freq ainer (3) - 2 freq gener (3) - 1 freq jyner (3) - 30 freq maner (3) - 4 freq doner (3) - 2 freq inner (3) - 46 freq awner (3) - 4 freq boer (3) - 3 freq brer (3) - 2 freq loner (3) - 1 freq einar (3) - 27 freq uber (3) - 2 freq jiner (3) - 7 freq |
SoundEx code - E156 ephemeral - 6 freq 'ephemeral' - 3 freq eye-opener - 1 freq ephemeralisation's - 1 freq ephemerae - 1 freq ephemera - 1 freq ebner - 5 freq ebner's - 1 freq ee-opener - 1 freq |
MetaPhone code - EBNR ebner - 5 freq |
EBNER |
| Time to execute Levenshtein function - 0.204480 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.420063 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.060244 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.045729 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.000944 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. |