| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| ebenezer (0) - 36 freq beezer (2) - 11 freq whene'er (3) - 3 freq beeger (3) - 6 freq freezer (3) - 14 freq wheneer (3) - 1 freq eveneen (3) - 4 freq bleezer (3) - 1 freq bender (3) - 5 freq whenever (3) - 78 freq eliezer (3) - 3 freq breezer (3) - 5 freq eezer (3) - 1 freq eeeze (3) - 1 freq meneer (3) - 1 freq geezer (3) - 6 freq beemer (3) - 2 freq ebner (3) - 5 freq veneer (3) - 1 freq wey-never (4) - 1 freq bunder (4) - 1 freq onbelever (4) - 1 freq enster (4) - 2 freq daener (4) - 2 freq deener (4) - 3 freq |
ebenezer (0) - 36 freq beezer (3) - 11 freq bender (4) - 5 freq breezer (4) - 5 freq bleezer (4) - 1 freq ebner (4) - 5 freq blazer (5) - 8 freq benzema (5) - 1 freq banger (5) - 5 freq bonnier (5) - 24 freq banter (5) - 43 freq boozer (5) - 36 freq bunter (5) - 8 freq buzzer (5) - 8 freq banker (5) - 12 freq binder (5) - 23 freq bynear (5) - 2 freq panzer (5) - 1 freq bunder (5) - 1 freq binner (5) - 2 freq bunker (5) - 23 freq geezer (5) - 6 freq beemer (5) - 2 freq meneer (5) - 1 freq eliezer (5) - 3 freq |
SoundEx code - E152 evens - 1 freq ewbank - 1 freq ebenezer - 36 freq epwinkle - 1 freq evaungelists - 1 freq evangelists - 1 freq evans - 27 freq euphemism - 1 freq euphemistically - 1 freq evangelistic - 1 freq eabmclc - 1 freq evangelism - 1 freq |
MetaPhone code - EBNSR ebenezer - 36 freq |
EBENEZER |
| Time to execute Levenshtein function - 0.198929 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.361543 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.027463 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.040250 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.000928 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. |