| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| ersed (0) - 6 freq arsed (1) - 19 freq eried (1) - 6 freq ersel (1) - 36 freq ersei (1) - 1 freq erses (1) - 23 freq erse (1) - 270 freq eused (1) - 1 freq erred (1) - 1 freq eesed (1) - 65 freq erased (1) - 4 freq versed (1) - 4 freq erved (1) - 1 freq erse' (1) - 1 freq eased (1) - 3 freq eres (2) - 1 freq tred (2) - 33 freq erawed (2) - 1 freq erste (2) - 1 freq merked (2) - 16 freq dreed (2) - 13 freq eser (2) - 1 freq ersch (2) - 1 freq sed (2) - 175 freq hersel (2) - 1059 freq |
ersed (0) - 6 freq erased (1) - 4 freq arsed (1) - 19 freq versed (2) - 4 freq erse' (2) - 1 freq reesed (2) - 12 freq reised (2) - 1 freq eesed (2) - 65 freq eased (2) - 3 freq erved (2) - 1 freq erred (2) - 1 freq ersei (2) - 1 freq eried (2) - 6 freq ersel (2) - 36 freq erses (2) - 23 freq eused (2) - 1 freq erse (2) - 270 freq yersel (3) - 920 freq ursel (3) - 2 freq nursed (3) - 5 freq ersh (3) - 1 freq oesed (3) - 3 freq urged (3) - 5 freq ried (3) - 2 freq yised (3) - 4 freq |
SoundEx code - E623 erected - 3 freq erect - 3 freq earshot - 10 freq 'ersatz - 1 freq ersatz - 2 freq erection - 3 freq erstwhile - 1 freq erased - 4 freq erest - 10 freq erekkit - 2 freq erst - 5 freq erste - 1 freq eurystheus - 41 freq eurystheus's - 8 freq ersed - 6 freq earra-ghàidheal - 1 freq erectin - 1 freq erectit - 1 freq erse-deep - 1 freq eruction - 1 freq eriction - 1 freq eerawasteofreshair - 1 freq erictrump - 1 freq eorisdale - 1 freq ereyesterday - 2 freq |
MetaPhone code - ERST erased - 4 freq erest - 10 freq erst - 5 freq erste - 1 freq ersed - 6 freq |
ERSED |
| Time to execute Levenshtein function - 0.211543 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.354673 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.028075 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.037659 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.000880 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. |