Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
---|---|---|---|---|
eber (0) - 3 freq e'er (1) - 59 freq efer (1) - 1 freq ewer (1) - 2 freq eser (1) - 1 freq ebr (1) - 1 freq ueber (1) - 1 freq ever (1) - 899 freq weber (1) - 1 freq eer (1) - 192 freq ebner (1) - 5 freq uber (1) - 2 freq euer (1) - 6 freq ber (1) - 4 freq err (2) - 40 freq eye (2) - 237 freq ewen (2) - 7 freq beq (2) - 1 freq 'be' (2) - 2 freq ebb (2) - 27 freq neeber (2) - 2 freq eden (2) - 36 freq bern (2) - 10 freq €œer (2) - 1 freq feer (2) - 4 freq |
eber (0) - 3 freq ueber (1) - 1 freq uber (1) - 2 freq ebr (1) - 1 freq ber (1) - 4 freq bier (2) - 3 freq bear (2) - 217 freq bir (2) - 2 freq boer (2) - 3 freq br (2) - 4 freq beir (2) - 18 freq bar (2) - 493 freq beer (2) - 142 freq ebro (2) - 1 freq bor (2) - 4 freq aaber (2) - 22 freq baer (2) - 2 freq bur (2) - 8 freq efer (2) - 1 freq e'er (2) - 59 freq weber (2) - 1 freq ewer (2) - 2 freq ever (2) - 899 freq eser (2) - 1 freq ebner (2) - 5 freq |
SoundEx code - E160 ever - 899 freq every - 822 freq efer - 1 freq euphoria - 4 freq 'every - 5 freq evri - 13 freq evir - 4 freq eebroo - 6 freq eevory - 2 freq everee - 1 freq eyebrow - 2 freq evvir - 6 freq eyebroo - 10 freq evry - 12 freq ev'ry - 6 freq ee-broo - 6 freq eber - 3 freq evvir' - 1 freq ewvir - 1 freq ee-brow - 2 freq every- - 1 freq everywye - 2 freq eviry - 1 freq everie - 4 freq effray - 1 freq effair - 1 freq ebro - 1 freq efir - 1 freq effeir - 1 freq efr - 1 freq €™ever - 1 freq efier - 1 freq ebr - 1 freq eever - 2 freq evviry - 1 freq |
MetaPhone code - EBR eebroo - 6 freq ee-broo - 6 freq eber - 3 freq ee-brow - 2 freq ebro - 1 freq ebr - 1 freq |
EBER |
Time to execute Levenshtein function - 0.193425 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.340507 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.027328 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.040497 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.001052 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. |