Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
---|---|---|---|---|
eersel (0) - 28 freq hersel (1) - 1057 freq yersel (1) - 913 freq ersel (1) - 36 freq uersel (1) - 1 freq eesel (1) - 1 freq eersell (1) - 1 freq eersels (1) - 1 freq eezsel (1) - 1 freq eensel (1) - 6 freq ursel (2) - 2 freq irsel (2) - 2 freq 'yersel (2) - 2 freq hetsel (2) - 1 freq eisel (2) - 1 freq eesed (2) - 65 freq oursel (2) - 1 freq desel (2) - 4 freq yirsel (2) - 79 freq eers (2) - 9 freq terrel (2) - 6 freq t'ersel (2) - 7 freq hersael (2) - 1 freq harsel (2) - 1 freq verse' (2) - 1 freq |
eersel (0) - 28 freq uersel (1) - 1 freq ersel (1) - 36 freq yersel (1) - 913 freq oorsel (2) - 10 freq yursel (2) - 10 freq yeirsel (2) - 2 freq reesel (2) - 4 freq yirsel (2) - 79 freq irsel (2) - 2 freq oursel (2) - 1 freq ursel (2) - 2 freq eesel (2) - 1 freq hersel (2) - 1057 freq eensel (2) - 6 freq eersell (2) - 1 freq eersels (2) - 1 freq eezsel (2) - 1 freq warsel (3) - 3 freq yer'sel (3) - 2 freq yersell (3) - 26 freq ersei (3) - 1 freq erse' (3) - 1 freq morsel (3) - 5 freq ersed (3) - 6 freq |
SoundEx code - E624 ersehole - 12 freq ersel - 36 freq erse-hole - 1 freq erse-lickin - 1 freq eersel - 28 freq erse'll - 1 freq eraichle - 1 freq erkaltet - 1 freq erchie'll - 1 freq earshall - 1 freq erseholes - 3 freq ericcolsen - 6 freq eersell - 1 freq eersels - 1 freq |
MetaPhone code - ERSL ersel - 36 freq eersel - 28 freq aerosol - 6 freq erse'll - 1 freq eersell - 1 freq |
EERSEL |
Time to execute Levenshtein function - 0.182964 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.321768 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.027266 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.036794 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.000809 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. |