| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| erred (0) - 1 freq ersed (1) - 6 freq serred (1) - 9 freq erved (1) - 1 freq eried (1) - 6 freq eire (2) - 3 freq tired (2) - 102 freq erawed (2) - 1 freq weered (2) - 3 freq served (2) - 75 freq tried (2) - 687 freq roed (2) - 1 freq braed (2) - 5 freq egged (2) - 5 freq wired (2) - 15 freq elren (2) - 1 freq kerried (2) - 23 freq err (2) - 40 freq marred (2) - 5 freq preed (2) - 4 freq ernes (2) - 1 freq yerked (2) - 2 freq termed (2) - 1 freq traed (2) - 5 freq fred (2) - 26 freq |
erred (0) - 1 freq reared (2) - 24 freq eried (2) - 6 freq rared (2) - 2 freq erved (2) - 1 freq serred (2) - 9 freq ersed (2) - 6 freq raed (3) - 21 freq irked (3) - 1 freq veered (3) - 6 freq peered (3) - 26 freq weired (3) - 2 freq feered (3) - 2 freq erd (3) - 11 freq leared (3) - 1 freq ried (3) - 2 freq rted (3) - 1 freq tryed (3) - 3 freq errol (3) - 2 freq herried (3) - 4 freq eard (3) - 1 freq lurred (3) - 1 freq cared (3) - 34 freq bred (3) - 36 freq erra (3) - 3 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 |
ERRED |
| Time to execute Levenshtein function - 0.233858 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.721319 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.087098 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.097362 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.001193 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. |