| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| ellenjoywebster (0) - 1 freq elainewebster (5) - 1 freq etkwebster (7) - 5 freq rollercoaster (8) - 7 freq lobster (8) - 23 freq enjoyment (8) - 7 freq webster (8) - 8 freq sklentyweys (8) - 1 freq thefrogmeister (8) - 4 freq blowster (8) - 1 freq noreaster (8) - 1 freq meenester (8) - 8 freq arlenefoster (8) - 1 freq nor'easter (8) - 1 freq bleester (8) - 7 freq enjoyable (8) - 7 freq leicester (8) - 2 freq ellenrwilson (8) - 1 freq gloucester (8) - 2 freq owerseer (9) - 5 freq chermometer (9) - 1 freq glenrothes (9) - 2 freq bleestert (9) - 1 freq molester (9) - 1 freq sheenster (9) - 150 freq |
ellenjoywebster (0) - 1 freq elainewebster (7) - 1 freq etkwebster (11) - 5 freq webster (12) - 8 freq arlenefoster (12) - 1 freq blowster (12) - 1 freq lobster (12) - 23 freq ellenrwilson (12) - 1 freq lobstir (13) - 1 freq gloucester (13) - 2 freq allister (13) - 1 freq wabster (13) - 17 freq lancaster (13) - 3 freq leicester (13) - 2 freq labster (13) - 6 freq lungawater (13) - 2 freq blockbuster (13) - 1 freq rollercoaster (13) - 7 freq noreaster (13) - 1 freq nor'easter (13) - 1 freq meenester (13) - 8 freq bleester (13) - 7 freq lowest (14) - 10 freq malafouster (14) - 2 freq lawnmowers (14) - 1 freq |
SoundEx code - E452 ellen's - 6 freq eilins - 4 freq elaine's - 1 freq elms - 1 freq elongatit - 2 freq eelnogitfit - 1 freq ellons - 1 freq ellon's - 1 freq elemjay - 2 freq ellenjoywebster - 1 freq ellemaich - 1 freq ellemcelle - 1 freq |
MetaPhone code - ELNJWBST |
ELLENJOYWEBSTER |
| Time to execute Levenshtein function - 0.230015 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.461920 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.031282 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.037008 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.000853 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. |