| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| deep-layered (0) - 1 freq weel-lared (4) - 4 freq deplored (5) - 1 freq weel-lairned (5) - 1 freq deepened (5) - 2 freq weel-natured (5) - 2 freq derk-haired (5) - 1 freq deployed (5) - 2 freq declared (5) - 26 freq weel-faured (5) - 3 freq weel-wared (5) - 2 freq explaened (5) - 1 freq deep-fried (5) - 9 freq explayned (5) - 1 freq delayed (5) - 4 freq deep-stowed (5) - 1 freq weil-lared (5) - 1 freq deescattered (5) - 1 freq displayed (5) - 7 freq weel-leared (5) - 3 freq multi-layered (5) - 1 freq weel-cared (5) - 1 freq layered (5) - 3 freq displaeced (5) - 1 freq deep-seasoned (5) - 1 freq |
deep-layered (0) - 1 freq weel-lared (6) - 4 freq deep-fried (6) - 9 freq deplored (6) - 1 freq dee-haird (7) - 1 freq depleted (7) - 1 freq weel-leared (7) - 3 freq weil-lared (7) - 1 freq declered (7) - 2 freq deployed (7) - 2 freq declared (7) - 26 freq deep-seasoned (8) - 1 freq displaeced (8) - 1 freq layered (8) - 3 freq explored (8) - 4 freq deplore (8) - 1 freq despaired (8) - 2 freq weel-cared (8) - 1 freq deepseaworld (8) - 1 freq replayed (8) - 1 freq dug-eared (8) - 1 freq delivered (8) - 36 freq weel-faured (8) - 3 freq weel-wared (8) - 2 freq deepened (8) - 2 freq |
SoundEx code - D146 devilry - 2 freq doublers - 2 freq deplore - 1 freq deplored - 1 freq deep-layered - 1 freq doubler - 6 freq double-ring - 1 freq divilry - 1 freq dabblersdoric - 1 freq devilwrstartan - 1 freq doobler - 1 freq |
MetaPhone code - TPLYRT deep-layered - 1 freq |
DEEP-LAYERED |
| Time to execute Levenshtein function - 0.257716 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.409293 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.028413 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.037106 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.003996 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. |