| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| yellocht (0) - 1 freq yelloch (1) - 7 freq bellocht (1) - 1 freq yellochs (1) - 1 freq bellochs (2) - 1 freq belloch (2) - 3 freq yellochin (2) - 11 freq yelloched (2) - 34 freq yelloo (3) - 1 freq flocht (3) - 4 freq betocht (3) - 1 freq yellit (3) - 1 freq bellochin (3) - 3 freq mollochy (3) - 1 freq bedlicht (3) - 1 freq felloot (3) - 1 freq yallochie (3) - 1 freq belloched (3) - 21 freq skelloch (3) - 5 freq yellt (3) - 4 freq walloch (3) - 1 freq besocht (3) - 2 freq gulloch (3) - 4 freq golloch (3) - 1 freq yellows (3) - 4 freq |
yellocht (0) - 1 freq yellochs (2) - 1 freq bellocht (2) - 1 freq yelloch (2) - 7 freq yellochin (3) - 11 freq yelloched (3) - 34 freq bellochs (4) - 1 freq helcht (4) - 1 freq belloch (4) - 3 freq delicht (4) - 62 freq yallochie (4) - 1 freq flocht (4) - 4 freq licht (5) - 909 freq daylycht (5) - 1 freq liecht (5) - 1 freq claucht (5) - 54 freq allocate (5) - 2 freq daylicht (5) - 47 freq laacht (5) - 6 freq lycht (5) - 3 freq blicht (5) - 4 freq flacht (5) - 1 freq blacht (5) - 4 freq laucht (5) - 22 freq slicht (5) - 23 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 - YLXT yellocht - 1 freq yelloched - 34 freq |
YELLOCHT |
| Time to execute Levenshtein function - 0.375622 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.587675 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.030019 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.078055 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.000922 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. |