| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| wipers (0) - 4 freq pipers (1) - 10 freq vipers (1) - 5 freq wipes (1) - 4 freq wiprt (2) - 1 freq wyper (2) - 1 freq wier (2) - 2 freq wises (2) - 1 freq nippers (2) - 2 freq widders (2) - 2 freq sippers (2) - 1 freq viper (2) - 1 freq papers (2) - 137 freq uppers (2) - 2 freq riders (2) - 8 freq wirs (2) - 4 freq bikers (2) - 2 freq waders (2) - 4 freq miners (2) - 41 freq hikers (2) - 2 freq bilers (2) - 1 freq uisers (2) - 17 freq wife's (2) - 27 freq divers (2) - 10 freq piper (2) - 31 freq |
wipers (0) - 4 freq vipers (2) - 5 freq wipes (2) - 4 freq pipers (2) - 10 freq wips (3) - 1 freq capers (3) - 7 freq wires (3) - 27 freq wagers (3) - 1 freq lepers (3) - 4 freq topers (3) - 1 freq weers (3) - 16 freq waiters (3) - 8 freq waters (3) - 18 freq paipers (3) - 5 freq japers (3) - 15 freq waders (3) - 4 freq neipers (3) - 2 freq piers (3) - 7 freq wavers (3) - 1 freq leipers (3) - 2 freq wyper (3) - 1 freq wiprt (3) - 1 freq rypers (3) - 1 freq pers (3) - 1 freq papers (3) - 137 freq |
SoundEx code - W162 wipers - 4 freq whoever's - 1 freq weavers - 9 freq whaiver's - 2 freq wfirst - 2 freq wabwark - 3 freq wabwarks - 1 freq whoppers - 1 freq weavers' - 1 freq wavers - 1 freq wab-brousers - 1 freq |
MetaPhone code - WPRS wipers - 4 freq whoppers - 1 freq |
WIPERS |
| Time to execute Levenshtein function - 0.241443 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.387017 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.032236 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.037888 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.000865 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. |