| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| edges (0) - 32 freq edge (1) - 190 freq aedges (1) - 3 freq edged (1) - 9 freq ledges (1) - 3 freq wedges (1) - 1 freq hedges (1) - 38 freq odes (2) - 5 freq wedge (2) - 8 freq 'ages (2) - 1 freq eager (2) - 27 freq judges (2) - 19 freq sages (2) - 1 freq eggs (2) - 175 freq 'does (2) - 5 freq egs (2) - 2 freq egos (2) - 4 freq ledge (2) - 15 freq does (2) - 385 freq erles (2) - 1 freq dees (2) - 41 freq edders (2) - 1 freq adaes (2) - 1 freq daes (2) - 213 freq eares (2) - 1 freq |
edges (0) - 32 freq aedges (1) - 3 freq hedges (2) - 38 freq edge (2) - 190 freq wedges (2) - 1 freq ledges (2) - 3 freq edged (2) - 9 freq edg (3) - 1 freq odgers (3) - 1 freq eiggs (3) - 8 freq peges (3) - 1 freq dyes (3) - 4 freq radges (3) - 1 freq cages (3) - 9 freq dge (3) - 1 freq pages (3) - 132 freq idles (3) - 1 freq fudges (3) - 2 freq dues (3) - 10 freq ges (3) - 1 freq neiges (3) - 1 freq digs (3) - 19 freq urges (3) - 2 freq eddies (3) - 1 freq heges (3) - 1 freq |
SoundEx code - E322 edges - 32 freq eitches - 1 freq edgewise - 1 freq |
MetaPhone code - EJS edges - 32 freq aedges - 3 freq |
EDGES |
| Time to execute Levenshtein function - 0.186769 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.406469 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.029202 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.038262 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.000955 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. |