| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| eeger (0) - 1 freq seeger (1) - 1 freq beeger (1) - 6 freq teeger (1) - 187 freq eezer (1) - 1 freq feeger (1) - 1 freq eager (1) - 27 freq eever (1) - 2 freq meter (2) - 8 freq weyer (2) - 1 freq eened (2) - 3 freq heeder (2) - 1 freq tiger (2) - 27 freq eesel (2) - 1 freq eber (2) - 3 freq eer (2) - 1 freq geer (2) - 16 freq keener (2) - 6 freq sever (2) - 3 freq weer (2) - 68 freq neer (2) - 51 freq ee-ers (2) - 1 freq wee-er (2) - 29 freq neeper (2) - 5 freq edder (2) - 21 freq |
eeger (0) - 1 freq eager (1) - 27 freq eever (2) - 2 freq ger (2) - 2 freq aiger (2) - 2 freq geer (2) - 16 freq feeger (2) - 1 freq beeger (2) - 6 freq seeger (2) - 1 freq eezer (2) - 1 freq teeger (2) - 187 freq e'er (3) - 58 freq gaer (3) - 7 freq beer (3) - 140 freq meyer (3) - 5 freq lager (3) - 38 freq teiger (3) - 1 freq geir (3) - 14 freq yeer (3) - 22 freq teegar (3) - 4 freq eser (3) - 1 freq seer (3) - 39 freq geezer (3) - 6 freq weeer (3) - 2 freq voger (3) - 1 freq |
SoundEx code - E260 eager - 27 freq easier - 111 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 |
EEGER |
| Time to execute Levenshtein function - 0.199979 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.390403 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.029622 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.037763 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.003189 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. |