Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
---|---|---|---|---|
erms (0) - 48 freq eres (1) - 1 freq perms (1) - 2 freq eras (1) - 2 freq emms (1) - 1 freq er's (1) - 20 freq erns (1) - 1 freq ferms (1) - 44 freq ers (1) - 25 freq erm (1) - 70 freq erts (1) - 11 freq germs (1) - 4 freq ems (1) - 4 freq eros (1) - 16 freq erss (1) - 3 freq elms (1) - 1 freq arms (1) - 67 freq terms (1) - 133 freq ermy (1) - 2 freq errs (1) - 1 freq eens (2) - 131 freq dems (2) - 6 freq urss (2) - 1 freq jams (2) - 3 freq crams (2) - 2 freq |
erms (0) - 48 freq arms (1) - 67 freq orams (2) - 1 freq reums (2) - 1 freq terms (2) - 133 freq reams (2) - 5 freq ermy (2) - 2 freq rams (2) - 6 freq aurms (2) - 1 freq armys (2) - 1 freq eres (2) - 1 freq airms (2) - 451 freq rims (2) - 3 freq elms (2) - 1 freq errs (2) - 1 freq eras (2) - 2 freq ers (2) - 25 freq erss (2) - 3 freq emms (2) - 1 freq er's (2) - 20 freq ferms (2) - 44 freq erns (2) - 1 freq erm (2) - 70 freq ems (2) - 4 freq eros (2) - 16 freq |
SoundEx code - E652 earrins - 2 freq erying - 1 freq erms - 48 freq ermchair - 10 freq earnestly - 4 freq earrings - 8 freq eerins - 6 freq earnest - 13 freq ernest - 6 freq eerin's - 1 freq errins - 1 freq earringed - 1 freq earns - 3 freq erns - 1 freq ee-wharms - 1 freq ern-cairriers - 1 freq erin's - 3 freq ernie's - 2 freq erm-chair - 1 freq eernest-like - 1 freq erne's - 1 freq euromosaic - 1 freq eerans - 1 freq ernes - 1 freq eringrieve - 7 freq eerrans - 1 freq |
MetaPhone code - ERMS erms - 48 freq erumbs - 2 freq |
ERMS |
Time to execute Levenshtein function - 0.256886 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.451265 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.028811 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.039994 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.000968 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. |