| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| edge (0) - 190 freq hedge (1) - 41 freq aedge (1) - 8 freq ege (1) - 4 freq ledge (1) - 15 freq edges (1) - 32 freq dge (1) - 1 freq edg (1) - 1 freq wedge (1) - 8 freq edged (1) - 9 freq edgy (1) - 7 freq sedge (1) - 1 freq hege (2) - 2 freq neige (2) - 2 freq eiged (2) - 1 freq ecg (2) - 1 freq seige (2) - 1 freq inge (2) - 1 freq ddg (2) - 1 freq edrw (2) - 1 freq lerge (2) - 1 freq lede (2) - 9 freq edu (2) - 3 freq gadge (2) - 4 freq eye (2) - 237 freq |
edge (0) - 190 freq dge (1) - 1 freq edgy (1) - 7 freq edg (1) - 1 freq aedge (1) - 8 freq odige (2) - 1 freq sedge (2) - 1 freq aidge (2) - 5 freq adige (2) - 1 freq dg (2) - 19 freq adage (2) - 2 freq hedge (2) - 41 freq edges (2) - 32 freq ege (2) - 4 freq edged (2) - 9 freq wedge (2) - 8 freq ledge (2) - 15 freq veage (3) - 9 freq edmo (3) - 1 freq dgw (3) - 1 freq dye (3) - 13 freq ange (3) - 1 freq ego (3) - 14 freq edfu (3) - 1 freq hodge (3) - 3 freq |
SoundEx code - E320 edge - 190 freq eats - 30 freq etec - 1 freq eh-it's - 1 freq etc - 191 freq eattocks - 1 freq edgy - 7 freq eit's - 29 freq et's - 8 freq eits - 1 freq etse - 1 freq eets - 58 freq eet's - 58 freq eat's - 1 freq eddie's - 3 freq edick - 1 freq etts - 2 freq eddies - 1 freq ethic - 1 freq eatch - 1 freq eds - 9 freq etch - 2 freq ethics - 3 freq etc' - 3 freq eidduc - 1 freq ethos - 2 freq €™edge - 1 freq etjwh - 1 freq ehts - 1 freq etxu - 1 freq etoo's - 1 freq edg - 1 freq 'eats - 2 freq ethgx - 1 freq edj - 1 freq etg - 1 freq etsy - 1 freq etjx - 1 freq eoeutzi - 1 freq |
MetaPhone code - EJ edge - 190 freq edgy - 7 freq aedge - 8 freq ege - 4 freq €™edge - 1 freq ej - 1 freq ejo - 1 freq |
EDGE |
| Time to execute Levenshtein function - 0.205820 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.348743 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.027966 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.042778 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.000922 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. |