| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| yellochin (0) - 11 freq bellochin (1) - 3 freq yelloched (2) - 34 freq skellochin (2) - 7 freq yallochie (2) - 1 freq yellocht (2) - 1 freq yellochs (2) - 1 freq yelloch (2) - 7 freq wallochin (2) - 1 freq grallochin (3) - 1 freq bellochs (3) - 1 freq slochin (3) - 2 freq belloch (3) - 3 freq bellocht (3) - 1 freq belloched (3) - 21 freq bollockin (3) - 1 freq yellin (3) - 13 freq belchin (3) - 2 freq mollachin (3) - 1 freq gollachin (3) - 1 freq yeuchin (3) - 1 freq lockin (4) - 7 freq slockin (4) - 1 freq moochin (4) - 4 freq cellophane (4) - 1 freq |
yellochin (0) - 11 freq bellochin (2) - 3 freq yellochs (3) - 1 freq wallochin (3) - 1 freq yelloch (3) - 7 freq yellocht (3) - 1 freq yallochie (3) - 1 freq yelloched (3) - 34 freq belchin (4) - 2 freq mollachin (4) - 1 freq gollachin (4) - 1 freq slochin (4) - 2 freq skellochin (4) - 7 freq flechin (5) - 1 freq yellyhooin (5) - 2 freq lurchin (5) - 1 freq latchin (5) - 2 freq lachin (5) - 46 freq lochan (5) - 26 freq claichin (5) - 1 freq leechin (5) - 1 freq laachin (5) - 27 freq bleachin (5) - 4 freq lauchin (5) - 99 freq allocatin (5) - 1 freq |
SoundEx code - Y425 yellochin - 11 freq yalkin - 2 freq yellasome - 1 freq |
MetaPhone code - YLXN yellochin - 11 freq |
YELLOCHIN |
| Time to execute Levenshtein function - 0.210031 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.349926 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.029203 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.037573 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.000983 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. |