| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| eagerly (0) - 31 freq early (2) - 358 freq easterly (2) - 4 freq aerly (2) - 19 freq sagely (2) - 2 freq anerly (2) - 7 freq eager (2) - 27 freq elderly (2) - 14 freq everly (2) - 1 freq easely (2) - 1 freq sugery (3) - 1 freq eery (3) - 2 freq ainerly (3) - 2 freq fairly (3) - 233 freq orderly (3) - 4 freq raelly (3) - 67 freq easily (3) - 59 freq lagers (3) - 2 freq faiderly (3) - 1 freq bakery (3) - 16 freq nearly (3) - 287 freq awely (3) - 8 freq eardly (3) - 1 freq sweerly (3) - 1 freq queerly (3) - 1 freq |
eagerly (0) - 31 freq eager (3) - 27 freq everly (3) - 1 freq anerly (3) - 7 freq gurly (3) - 17 freq girly (3) - 1 freq aerly (3) - 19 freq early (3) - 358 freq girl (4) - 73 freq earl (4) - 31 freq harly (4) - 13 freq rairly (4) - 1 freq peerly (4) - 1 freq overly (4) - 6 freq ferly (4) - 20 freq nairly (4) - 1 freq erly (4) - 3 freq sairly (4) - 28 freq pearly (4) - 5 freq sarely (4) - 1 freq germy (4) - 1 freq haurly (4) - 16 freq barely (4) - 96 freq neerly (4) - 1 freq eeger (4) - 1 freq |
SoundEx code - E264 eagerly - 31 freq exrelationship - 1 freq eecharlieallan - 4 freq eggcharlotte - 1 freq |
MetaPhone code - EJRL eagerly - 31 freq |
EAGERLY |
| Time to execute Levenshtein function - 0.187227 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.350904 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.026923 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.036931 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.000813 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. |