| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| well-respected (0) - 1 freq weel-respected (1) - 1 freq weel-respectit (3) - 1 freq well-deserved (4) - 1 freq self-respect (4) - 2 freq respected (5) - 11 freq weeltespectit (5) - 1 freq well-designed (5) - 1 freq well-rehearsed (5) - 1 freq well-suited (5) - 1 freq well-heeled (5) - 1 freq well-stocked (5) - 1 freq well-kept (6) - 1 freq weel-shewed (6) - 1 freq well-rubbed (6) - 1 freq represented (6) - 9 freq weel-creeshed (6) - 1 freq well-mannered (6) - 1 freq weel-trusted (6) - 1 freq weel-presairved (6) - 1 freq weel-pressed (6) - 2 freq well-upfeshed (6) - 1 freq well-spoken (6) - 2 freq ill-repute (6) - 1 freq well-adjusted (6) - 1 freq |
well-respected (0) - 1 freq weel-respected (2) - 1 freq weel-respectit (5) - 1 freq self-respect (7) - 2 freq well-suited (8) - 1 freq well-deserved (8) - 1 freq well-stocked (8) - 1 freq well-rehearsed (9) - 1 freq weeltespectit (9) - 1 freq well-designed (9) - 1 freq respected (9) - 11 freq weel-trusted (10) - 1 freq well-adjusted (10) - 1 freq ill-repute (10) - 1 freq well-heeled (10) - 1 freq well-kept (10) - 1 freq well-spoken (10) - 2 freq well-rubbed (10) - 1 freq hell-ejectit (11) - 1 freq weill-panged (11) - 1 freq weel-dressed (11) - 2 freq weill-placed (11) - 1 freq respectet (11) - 1 freq weel-creeshed (11) - 1 freq well-paid (11) - 1 freq |
SoundEx code - W462 walrus - 9 freq weel-rigged - 1 freq weel-respected - 1 freq whalers - 8 freq wheelers - 1 freq well-respected - 1 freq weill-wrocht - 2 freq weel-wrocht - 3 freq waalruses - 1 freq weel-regairdit - 2 freq weel-respectit - 1 freq weel-wirked - 1 freq woolwork - 2 freq wlrqslwr - 1 freq |
MetaPhone code - WLRSPKTT weel-respected - 1 freq well-respected - 1 freq weel-respectit - 1 freq |
WELL-RESPECTED |
| Time to execute Levenshtein function - 0.622045 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.996723 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.062564 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.039670 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.000993 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. |