| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| eried (0) - 6 freq pried (1) - 2 freq dried (1) - 74 freq erred (1) - 1 freq erie (1) - 1 freq fried (1) - 33 freq bried (1) - 10 freq gried (1) - 8 freq eries (1) - 1 freq elied (1) - 1 freq ried (1) - 2 freq erved (1) - 1 freq tried (1) - 687 freq cried (1) - 983 freq ersed (1) - 6 freq herded (2) - 1 freq erse (2) - 270 freq cricd (2) - 1 freq crie (2) - 7 freq erey (2) - 1 freq hered (2) - 2 freq eerie (2) - 34 freq ere (2) - 288 freq buried (2) - 47 freq erd (2) - 11 freq |
eried (0) - 6 freq ried (1) - 2 freq arid (2) - 5 freq red (2) - 297 freq cried (2) - 983 freq rid (2) - 313 freq raed (2) - 21 freq reed (2) - 184 freq erd (2) - 11 freq roed (2) - 1 freq tried (2) - 687 freq rued (2) - 7 freq ersed (2) - 6 freq erved (2) - 1 freq fried (2) - 33 freq erred (2) - 1 freq dried (2) - 74 freq pried (2) - 2 freq bried (2) - 10 freq erie (2) - 1 freq elied (2) - 1 freq eries (2) - 1 freq gried (2) - 8 freq ertie (3) - 12 freq eild (3) - 17 freq |
SoundEx code - E630 earth - 253 freq erth - 3 freq eried - 6 freq eairrit - 3 freq erawed - 1 freq erd - 11 freq ert - 18 freq ere'd - 3 freq earth' - 1 freq eard - 1 freq eordie - 1 freq eoort - 1 freq eart - 4 freq ertie - 12 freq earthy - 1 freq ery't - 1 freq eairriet - 1 freq erred - 1 freq eert - 1 freq eirde - 2 freq €˜earth - 1 freq €™ert - 1 freq €œearth - 1 freq €™erheid - 1 freq eirth - 1 freq erode - 1 freq |
MetaPhone code - ERT eried - 6 freq eairrit - 3 freq erd - 11 freq ert - 18 freq ere'd - 3 freq eard - 1 freq eordie - 1 freq aert - 45 freq eoort - 1 freq eart - 4 freq ertie - 12 freq ery't - 1 freq eairriet - 1 freq erred - 1 freq eert - 1 freq eirde - 2 freq aerate - 1 freq €™ert - 1 freq erode - 1 freq |
ERIED |
| Time to execute Levenshtein function - 0.203982 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.361583 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.030470 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.048953 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.001003 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. |