| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| valeleithen (0) - 1 freq laberleithen (3) - 1 freq innerleithen (4) - 2 freq thegeither (5) - 1 freq leither (5) - 5 freq valediction (5) - 1 freq taegither (5) - 44 freq aneither (5) - 1 freq taegether (5) - 32 freq valentine (5) - 23 freq tane-tither (5) - 1 freq valerie (5) - 4 freq naithen (5) - 1 freq innerleithin (5) - 1 freq ayelestan (5) - 4 freq haithen (5) - 5 freq bleither (5) - 1 freq galevitchin (5) - 1 freq naeithin (5) - 1 freq veeseeten (5) - 1 freq aald-mither (5) - 1 freq satellites (5) - 7 freq calleen (5) - 1 freq dalkeith (5) - 17 freq eleiven (5) - 15 freq |
valeleithen (0) - 1 freq laberleithen (6) - 1 freq velveteen (7) - 2 freq valentine (7) - 23 freq innerleithen (7) - 2 freq everthin (8) - 2 freq valerian (8) - 1 freq callaghan (8) - 6 freq leviathan (8) - 3 freq sel-loathin (8) - 1 freq villish (8) - 1 freq eletven (8) - 1 freq portlethen (8) - 1 freq neithen (8) - 3 freq ayelestin (8) - 1 freq vallies (8) - 1 freq ivveryithin (8) - 1 freq valencian (8) - 6 freq vreiten (8) - 1 freq wallochin (8) - 1 freq lilith (8) - 3 freq validation (8) - 2 freq bulletin (8) - 6 freq valentino (8) - 1 freq volition (8) - 2 freq |
SoundEx code - V443 valeleithen - 1 freq |
MetaPhone code - FLL0N valeleithen - 1 freq |
VALELEITHEN |
| Time to execute Levenshtein function - 0.219490 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.415699 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.028062 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.037511 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.000882 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. |