| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| uersel (0) - 1 freq yersel (1) - 913 freq eersel (1) - 28 freq hersel (1) - 1057 freq ersel (1) - 36 freq ursel (1) - 2 freq easel (2) - 1 freq dervel (2) - 1 freq merkel (2) - 1 freq ersei (2) - 1 freq hetsel (2) - 1 freq yeirsel (2) - 2 freq irsel (2) - 2 freq desel (2) - 4 freq kernel (2) - 1 freq erse (2) - 269 freq merse (2) - 4 freq erses (2) - 23 freq persew (2) - 1 freq eesel (2) - 1 freq eisel (2) - 1 freq hursel (2) - 14 freq terrel (2) - 6 freq eersell (2) - 1 freq morsel (2) - 5 freq |
uersel (0) - 1 freq ursel (1) - 2 freq ersel (1) - 36 freq eersel (1) - 28 freq yersel (1) - 913 freq yursel (2) - 10 freq oursel (2) - 1 freq reesel (2) - 4 freq irsel (2) - 2 freq oorsel (2) - 10 freq yeirsel (2) - 2 freq yirsel (2) - 79 freq hersel (2) - 1057 freq harsel (3) - 1 freq aeriel (3) - 1 freq mesel (3) - 59 freq yesel (3) - 1 freq erse' (3) - 1 freq wursel (3) - 2 freq deesel (3) - 8 freq yersels (3) - 97 freq ersed (3) - 6 freq 'ursel (3) - 1 freq esel (3) - 2 freq yoursel (3) - 45 freq |
SoundEx code - U624 'ursel - 1 freq €˜ursel - 1 freq ursel - 2 freq uersel - 1 freq uirkglsk - 1 freq |
MetaPhone code - URSL 'ursel - 1 freq €˜ursel - 1 freq ursel - 2 freq uersel - 1 freq |
UERSEL |
| Time to execute Levenshtein function - 0.203884 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.348329 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.028429 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.039239 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.001140 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. |