| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| yule-een (0) - 1 freq yule-e'en (1) - 1 freq gale-eyn (3) - 1 freq some-een (3) - 4 freq ye-keen (3) - 1 freq yee-ees (3) - 1 freq guid-een (3) - 1 freq ice-een (3) - 1 freq gledden (4) - 1 freq summeen (4) - 1 freq sullen (4) - 7 freq curteen (4) - 1 freq yettleen (4) - 1 freq maleen (4) - 1 freq fore-en (4) - 2 freq you-ken (4) - 1 freq yestereen (4) - 1 freq leaden (4) - 1 freq pulein (4) - 2 freq yeomen (4) - 1 freq yeee (4) - 1 freq keneen (4) - 2 freq eleyven (4) - 5 freq auchteen (4) - 5 freq eileen (4) - 18 freq |
yule-een (0) - 1 freq yule-e'en (2) - 1 freq ice-een (4) - 1 freq gale-eyn (4) - 1 freq aileen (5) - 7 freq aleyven (5) - 2 freq ool-eed (5) - 1 freq -een (5) - 1 freq eleeven (5) - 35 freq oul-man (5) - 1 freq eeleeven (5) - 1 freq aleen (5) - 97 freq leen (5) - 18 freq ilkeen (5) - 5 freq bile-in (5) - 1 freq aulden (5) - 15 freq lineen (5) - 1 freq bee-en (5) - 2 freq yulin (5) - 1 freq liveen (5) - 5 freq leeven (5) - 2 freq hole-an (5) - 2 freq yoleman (5) - 1 freq leiden (5) - 3 freq leaven (5) - 1 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 |
YULE-EEN |
| Time to execute Levenshtein function - 0.272325 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.508179 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.067850 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.050668 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.000775 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. |