| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| edra (0) - 5 freq ezra (1) - 3 freq dra (1) - 4 freq era (1) - 30 freq erra (1) - 3 freq edr (1) - 1 freq edrw (1) - 1 freq drf (2) - 1 freq hydra (2) - 11 freq erae (2) - 1 freq edit (2) - 17 freq eyre (2) - 7 freq lara (2) - 1 freq wdma (2) - 1 freq ena (2) - 16 freq ira (2) - 7 freq edge (2) - 190 freq udr (2) - 1 freq mdma (2) - 3 freq rora (2) - 2 freq ery (2) - 15 freq fara (2) - 1 freq ears (2) - 112 freq nora (2) - 6 freq werra (2) - 1 freq |
edra (0) - 5 freq edr (1) - 1 freq dra (1) - 4 freq draa (2) - 51 freq dry (2) - 472 freq udr (2) - 1 freq dr (2) - 199 freq dray (2) - 4 freq dura (2) - 1 freq ezra (2) - 3 freq era (2) - 30 freq erra (2) - 3 freq edrw (2) - 1 freq adna (3) - 1 freq drl (3) - 12 freq deary (3) - 4 freq edj (3) - 1 freq lora (3) - 1 freq heera (3) - 3 freq fedora (3) - 3 freq mora (3) - 8 freq draw (3) - 176 freq ebr (3) - 1 freq aura (3) - 11 freq euro (3) - 21 freq |
SoundEx code - E360 either - 458 freq eethur - 1 freq etter - 2 freq ether - 27 freq either' - 1 freq eethir - 10 freq eater - 2 freq edder - 21 freq eether - 12 freq eddir - 10 freq eddir' - 1 freq eider - 3 freq eader - 1 freq edr - 1 freq €˜either - 1 freq edra - 5 freq €™etre - 1 freq edrw - 1 freq edter - 1 freq etr - 1 freq 'either' - 1 freq |
MetaPhone code - ETR etter - 2 freq eater - 2 freq aeter - 1 freq edder - 21 freq eddir - 10 freq eddir' - 1 freq eider - 3 freq eader - 1 freq edr - 1 freq edra - 5 freq €™etre - 1 freq edrw - 1 freq etr - 1 freq |
EDRA |
| Time to execute Levenshtein function - 0.194197 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.370787 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.030063 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.038231 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.000909 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. |