| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| eager (0) - 27 freq eater (1) - 2 freq wager (1) - 9 freq pager (1) - 1 freq eader (1) - 1 freq eeger (1) - 1 freq lager (1) - 39 freq hagar (2) - 1 freq vader (2) - 3 freq easier (2) - 114 freq agr (2) - 1 freq seater (2) - 1 freq enter (2) - 74 freq bearer (2) - 7 freq mayer (2) - 1 freq eagles (2) - 11 freq baer (2) - 2 freq suger (2) - 1 freq racer (2) - 1 freq payer (2) - 1 freq eaze (2) - 1 freq jagger (2) - 2 freq ganger (2) - 1 freq leader (2) - 59 freq sanger (2) - 1 freq |
eager (0) - 27 freq eeger (1) - 1 freq ger (2) - 2 freq aiger (2) - 2 freq gaer (2) - 7 freq lager (2) - 39 freq agr (2) - 1 freq eater (2) - 2 freq pager (2) - 1 freq wager (2) - 9 freq eader (2) - 1 freq elyer (3) - 1 freq igor (3) - 6 freq faer (3) - 59 freq gaar (3) - 1 freq vaiger (3) - 1 freq egeria (3) - 1 freq paer (3) - 3 freq ear (3) - 143 freq acer (3) - 1 freq augur (3) - 1 freq eider (3) - 3 freq oaged (3) - 1 freq eagerly (3) - 31 freq wauger (3) - 3 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 - EJR eager - 27 freq egeria - 1 freq eeger - 1 freq |
EAGER |
| Time to execute Levenshtein function - 0.175200 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.334826 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.029914 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.042579 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.000861 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. |