Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
---|---|---|---|---|
elroy (0) - 2 freq ery (2) - 15 freq enrol (2) - 1 freq enry (2) - 1 freq ebro (2) - 1 freq elxy (2) - 1 freq early (2) - 366 freq troy (2) - 8 freq evry (2) - 12 freq eiron (2) - 1 freq ellon (2) - 19 freq milroy (2) - 3 freq erly (2) - 3 freq eliot (2) - 1 freq throy (2) - 1 freq enjoy (2) - 336 freq edrom (2) - 1 freq eery (2) - 2 freq elrig (2) - 9 freq delboy (2) - 2 freq tvroy (2) - 1 freq melro (2) - 1 freq eros (2) - 16 freq elon (2) - 1 freq ermy (2) - 2 freq |
elroy (0) - 2 freq elr (2) - 1 freq olr (3) - 2 freq euro (3) - 21 freq elren (3) - 1 freq erey (3) - 1 freq lr (3) - 5 freq elegy (3) - 6 freq lrmy (3) - 1 freq elby (3) - 2 freq elyer (3) - 1 freq elo (3) - 2 freq ely (3) - 1 freq lri (3) - 1 freq roy (3) - 54 freq melro (3) - 1 freq alloy (3) - 2 freq loor (3) - 2 freq elon (3) - 1 freq eliot (3) - 1 freq ebro (3) - 1 freq elxy (3) - 1 freq lory (3) - 42 freq troy (3) - 8 freq milroy (3) - 3 freq |
SoundEx code - E460 elroy - 2 freq elyer - 1 freq ellar - 1 freq elr - 1 freq |
MetaPhone code - ELR elroy - 2 freq ellar - 1 freq elr - 1 freq |
ELROY |
Time to execute Levenshtein function - 0.196329 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.351342 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.028038 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.044236 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.001107 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. |