| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| yellaestane (0) - 3 freq yellasome (4) - 1 freq yellaes (4) - 2 freq milestane (4) - 2 freq yella-man (4) - 1 freq millstane (4) - 2 freq lodestane (4) - 1 freq flagstane (4) - 1 freq inglestane (4) - 1 freq eyelestand (4) - 1 freq aye-lestand (4) - 1 freq limestane (4) - 2 freq sellatape (4) - 7 freq ayelestan (4) - 4 freq cellotape (5) - 1 freq plainstane (5) - 1 freq flagstanes (5) - 2 freq keystane (5) - 3 freq celestal (5) - 1 freq lairstane (5) - 3 freq blue-stane (5) - 1 freq wollaston (5) - 30 freq sanstane (5) - 1 freq ballantine (5) - 1 freq nellefant (5) - 2 freq |
yellaestane (0) - 3 freq millstane (5) - 2 freq limestane (5) - 2 freq ayelestan (5) - 4 freq lodestane (5) - 1 freq milestane (5) - 2 freq wollaston (6) - 30 freq lairstane (6) - 3 freq ayelestin (6) - 1 freq collieston (6) - 1 freq aye-lestin (6) - 1 freq hailstane (6) - 1 freq palestine (6) - 4 freq palestyne (6) - 1 freq milestone (6) - 2 freq millstone (6) - 1 freq flagstane (6) - 1 freq inglestane (6) - 1 freq yella-man (6) - 1 freq yellaes (6) - 2 freq yellasome (6) - 1 freq aye-lestand (6) - 1 freq eyelestand (6) - 1 freq milestene (6) - 1 freq collectan (7) - 2 freq |
SoundEx code - Y423 yellocht - 1 freq yelloched - 34 freq yae-lik-ah-doags - 1 freq yalkit - 1 freq yolked - 1 freq yalla-straikit - 1 freq yellaestane - 3 freq yellowstonetv - 1 freq |
MetaPhone code - YLSTN yellaestane - 3 freq |
YELLAESTANE |
| Time to execute Levenshtein function - 0.213830 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.404403 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.032458 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.050537 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.000916 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. |