| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| washer (0) - 5 freq hasher (1) - 1 freq washes (1) - 11 freq wather (1) - 75 freq asher (1) - 1 freq washers (1) - 1 freq waster (1) - 13 freq washed (1) - 90 freq washer' (1) - 1 freq washen (1) - 2 freq rasher (1) - 1 freq wasser (1) - 1 freq wastes (2) - 4 freq master (2) - 21 freq warker (2) - 7 freq posher (2) - 1 freq fisher (2) - 41 freq crasher (2) - 1 freq ashes (2) - 20 freq waver (2) - 1 freq easter (2) - 42 freq wastel (2) - 1 freq watter (2) - 1033 freq wasted (2) - 24 freq easjer (2) - 1 freq |
washer (0) - 5 freq washed (2) - 90 freq washer' (2) - 1 freq wasser (2) - 1 freq waster (2) - 13 freq washen (2) - 2 freq rasher (2) - 1 freq washers (2) - 1 freq hasher (2) - 1 freq washes (2) - 11 freq asher (2) - 1 freq wather (2) - 75 freq washit (3) - 1 freq washin (3) - 85 freq washan (3) - 3 freq waashes (3) - 4 freq wiser (3) - 26 freq washy (3) - 1 freq washd (3) - 2 freq waashed (3) - 9 freq wishen (3) - 2 freq wuther (3) - 3 freq cashier (3) - 1 freq wester (3) - 6 freq wishes (3) - 39 freq |
SoundEx code - W260 wycer - 6 freq wiser - 26 freq waiker - 5 freq wisker - 1 freq washer - 5 freq washer' - 1 freq wheecher - 2 freq wager - 9 freq weaker - 4 freq wicker - 2 freq whacker - 1 freq waaker - 1 freq whiskery - 1 freq wajer - 1 freq wokir - 1 freq wiker - 1 freq wauger - 3 freq wikker - 1 freq waeker - 1 freq whisker - 1 freq wheeker - 25 freq wasser - 1 freq wyacry - 1 freq wkr - 1 freq wwjr - 1 freq |
MetaPhone code - WXR watcher - 1 freq washer - 5 freq washer' - 1 freq wheecher - 2 freq witchery - 3 freq |
WASHER |
| Time to execute Levenshtein function - 0.178417 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.371397 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.027845 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.036816 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.000928 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. |