| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| euphirsspn (0) - 1 freq mcpherson (5) - 5 freq elphinstone (5) - 14 freq hissen (5) - 1 freq euphoric (5) - 3 freq quisson (5) - 3 freq uprisin (5) - 5 freq thirssle (5) - 1 freq expressin (5) - 12 freq uissan (5) - 3 freq uissin (5) - 1 freq suppressin (5) - 3 freq ericsson (5) - 1 freq hissin (5) - 10 freq expressan (5) - 1 freq elphinstane (5) - 3 freq euphemism (5) - 1 freq euphoria (5) - 4 freq pairson (5) - 2 freq pumpherston (5) - 1 freq phrasin (5) - 2 freq cuissen (5) - 1 freq emphasisin (5) - 3 freq pissin (5) - 17 freq empires' (5) - 2 freq |
euphirsspn (0) - 1 freq phrasin (7) - 2 freq pissin (8) - 17 freq birssin (8) - 1 freq emphasisin (8) - 3 freq pairson (8) - 2 freq hirslin (8) - 2 freq burssen (8) - 1 freq phrases (8) - 68 freq pressan (8) - 3 freq oppressin (8) - 1 freq pressin (8) - 25 freq expressan (8) - 1 freq hissan (8) - 1 freq expressin (8) - 12 freq suppressin (8) - 3 freq uprisin (8) - 5 freq thirssle (8) - 1 freq hissin (8) - 10 freq hissen (8) - 1 freq oppression (9) - 12 freq suppression (9) - 2 freq birsslin (9) - 4 freq undressin (9) - 1 freq horssis (9) - 4 freq |
SoundEx code - E162 everycunt - 18 freq ee-broos - 4 freq everycunt's - 4 freq eyebrows - 12 freq eebroos - 20 freq e-braes - 1 freq euphoric - 3 freq eyebroos - 6 freq evergreen - 6 freq everest - 1 freq everson - 3 freq evergreens - 1 freq eebrous - 3 freq e'ebroos - 1 freq ever-changin - 1 freq effairs - 3 freq efricans - 1 freq effeirs - 13 freq ever-supply - 1 freq euphirsspn - 1 freq e-freaking-gress - 1 freq |
MetaPhone code - EFRSPN euphirsspn - 1 freq |
EUPHIRSSPN |
| Time to execute Levenshtein function - 0.332503 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.586403 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.030523 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.045684 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.001245 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. |