| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| eezer (0) - 1 freq eever (1) - 2 freq eeger (1) - 1 freq geezer (1) - 6 freq beezer (1) - 11 freq bleezer (2) - 1 freq enfer (2) - 1 freq eese (2) - 107 freq weber (2) - 1 freq leper (2) - 2 freq eece (2) - 8 freq ne'er (2) - 173 freq heezes (2) - 5 freq lever (2) - 2 freq e'er (2) - 59 freq newer (2) - 7 freq seeger (2) - 1 freq beeger (2) - 6 freq feer (2) - 4 freq lee-er (2) - 1 freq deter (2) - 4 freq heefer (2) - 1 freq meyer (2) - 5 freq yeer (2) - 22 freq gener (2) - 1 freq |
eezer (0) - 1 freq beezer (2) - 11 freq geezer (2) - 6 freq eever (2) - 2 freq eeger (2) - 1 freq efier (3) - 1 freq azr (3) - 1 freq weeer (3) - 2 freq teer (3) - 5 freq eber (3) - 3 freq ee'r (3) - 1 freq razer (3) - 1 freq eader (3) - 1 freq eser (3) - 1 freq geer (3) - 16 freq veer (3) - 1 freq eemur (3) - 1 freq eez (3) - 105 freq yeeze (3) - 1 freq eaze (3) - 1 freq seer (3) - 39 freq ueber (3) - 1 freq peer (3) - 199 freq eater (3) - 2 freq meer (3) - 9 freq |
SoundEx code - E260 eager - 27 freq easier - 114 freq eesyer - 1 freq easjer - 1 freq egeria - 1 freq eezer - 1 freq ecairry - 1 freq ezra - 3 freq ex-chair - 1 freq eqr - 2 freq eser - 1 freq echr - 1 freq eeger - 1 freq |
MetaPhone code - ESR easier - 114 freq aesir - 4 freq eezer - 1 freq aesier - 13 freq ezra - 3 freq eser - 1 freq |
EEZER |
| Time to execute Levenshtein function - 0.372525 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.453782 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.027728 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.039085 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.000898 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. |