| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| yellin (0) - 13 freq yellit (1) - 1 freq yelling (1) - 1 freq mellin (1) - 64 freq dellin (1) - 5 freq bellin (1) - 3 freq fellin (1) - 3 freq yellan (1) - 1 freq rellin (1) - 1 freq yelpin (1) - 3 freq tellin (1) - 611 freq wellin (1) - 5 freq sellin (1) - 70 freq ellie (2) - 7 freq yowlin (2) - 16 freq wullin (2) - 23 freq beelin (2) - 22 freq yellaw (2) - 1 freq melldin (2) - 1 freq yerkin (2) - 4 freq shellin (2) - 3 freq yallit (2) - 1 freq yella (2) - 130 freq relyin (2) - 7 freq delvin (2) - 3 freq |
yellin (0) - 13 freq yellan (1) - 1 freq wellin (2) - 5 freq sellin (2) - 70 freq tellin (2) - 611 freq ellan (2) - 2 freq youllin (2) - 1 freq ellon (2) - 19 freq ellen (2) - 28 freq yelpin (2) - 3 freq mellin (2) - 64 freq yelling (2) - 1 freq yellit (2) - 1 freq rellin (2) - 1 freq dellin (2) - 5 freq fellin (2) - 3 freq bellin (2) - 3 freq yellad (3) - 1 freq yells (3) - 10 freq yalkin (3) - 2 freq yellt (3) - 4 freq yellow (3) - 39 freq kullin (3) - 1 freq fellen (3) - 1 freq duellin (3) - 2 freq |
SoundEx code - Y450 yellin - 13 freq yowlin - 16 freq yule-e'en - 1 freq ywowlin - 1 freq yellyhooin - 2 freq yellan - 1 freq youllin - 1 freq yulin - 1 freq yule-een - 1 freq |
MetaPhone code - YLN yellin - 13 freq yowlin - 16 freq yule-e'en - 1 freq yellan - 1 freq youllin - 1 freq yulin - 1 freq yule-een - 1 freq |
YELLIN |
| Time to execute Levenshtein function - 0.187218 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.472114 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.027368 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.076159 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.000878 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. |