| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| ellons (0) - 1 freq ellon's (1) - 1 freq ellon (1) - 19 freq ellot (2) - 1 freq bellows (2) - 6 freq melons (2) - 2 freq ellen's (2) - 6 freq tellins (2) - 5 freq luons (2) - 1 freq ella's (2) - 10 freq elbows (2) - 8 freq cello's (2) - 1 freq mellins (2) - 1 freq alloys (2) - 1 freq lyons (2) - 2 freq elton (2) - 2 freq ellan (2) - 2 freq yellows (2) - 4 freq lions (2) - 35 freq gallons (2) - 14 freq eatons (2) - 2 freq elon (2) - 1 freq nylons (2) - 1 freq loons (2) - 180 freq fellows (2) - 1 freq |
ellons (0) - 1 freq ellon (2) - 19 freq ullans (2) - 32 freq ellon's (2) - 1 freq talons (3) - 5 freq eilins (3) - 4 freq loons (3) - 180 freq gallons (3) - 14 freq nylons (3) - 1 freq allows (3) - 6 freq ellis (3) - 3 freq pylons (3) - 5 freq eildons (3) - 1 freq 'loons (3) - 1 freq allous (3) - 27 freq lions (3) - 35 freq ellen (3) - 28 freq alloos (3) - 38 freq alloys (3) - 1 freq mellins (3) - 1 freq yellows (3) - 4 freq luons (3) - 1 freq ella's (3) - 10 freq lyons (3) - 2 freq ellan (3) - 2 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 - ELNS ellen's - 6 freq eilins - 4 freq elaine's - 1 freq ellons - 1 freq ellon's - 1 freq |
ELLONS |
| Time to execute Levenshtein function - 0.284171 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.444559 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.028722 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.037667 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.000921 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. |