| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| wankers (0) - 5 freq warkers (1) - 43 freq waukers (1) - 1 freq wankers' (1) - 1 freq wanners (1) - 3 freq tankers (1) - 2 freq bankers (1) - 4 freq wanker (1) - 17 freq walkers (1) - 18 freq winkers (1) - 1 freq wanders (1) - 6 freq wickers (2) - 1 freq banners (2) - 15 freq rankels (2) - 1 freq rangers (2) - 55 freq landers (2) - 10 freq bangers (2) - 3 freq hankert (2) - 1 freq swanders (2) - 2 freq wanes (2) - 2 freq waaker (2) - 1 freq taakers (2) - 4 freq wanks (2) - 1 freq cankert (2) - 1 freq walters (2) - 4 freq |
wankers (0) - 5 freq winkers (1) - 1 freq walkers (2) - 18 freq waukers (2) - 1 freq warkers (2) - 43 freq wanker (2) - 17 freq wanders (2) - 6 freq wankers' (2) - 1 freq bankers (2) - 4 freq wanners (2) - 3 freq tankers (2) - 2 freq winners (3) - 30 freq bunkers (3) - 12 freq wurkers (3) - 6 freq wankier (3) - 1 freq minkers (3) - 3 freq bonkers (3) - 5 freq wirkers (3) - 20 freq winders (3) - 3 freq wunters (3) - 6 freq wikkers (3) - 1 freq wingers (3) - 1 freq winters (3) - 21 freq waunners (3) - 2 freq wonners (3) - 1 freq |
SoundEx code - W526 wance-aer - 1 freq wangrace - 1 freq winscreen - 1 freq wine-christ - 1 freq wanker - 17 freq wankers' - 1 freq wankers - 5 freq wuncher - 1 freq wanceower - 1 freq winger - 3 freq wanscrievit - 1 freq wham-sae-e'er - 1 freq wheengers - 1 freq €œwanker - 1 freq wankier - 1 freq wancertainities - 1 freq wancertainties - 1 freq wingers - 1 freq winkers - 1 freq |
MetaPhone code - WNKRS wangrace - 1 freq wankers' - 1 freq wankers - 5 freq winkers - 1 freq |
WANKERS |
| Time to execute Levenshtein function - 0.197931 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.364824 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.027331 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.037739 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.004694 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. |