| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| wrappers (0) - 8 freq wrapper (1) - 21 freq lappers (2) - 1 freq drapper (2) - 1 freq trippers (2) - 2 freq chappers (2) - 2 freq wapper (2) - 2 freq stappers (2) - 1 freq flappers (2) - 5 freq crapper (2) - 1 freq slappers (2) - 2 freq wappens (2) - 6 freq drapers (2) - 1 freq clappers (2) - 12 freq sappers (2) - 2 freq snappers (2) - 2 freq whoppers (2) - 1 freq rapper (2) - 4 freq wrapped (2) - 53 freq crampers (2) - 1 freq nappers (2) - 6 freq grapplers (2) - 1 freq clippers (3) - 6 freq writers (3) - 90 freq waiters (3) - 8 freq |
wrappers (0) - 8 freq wrapper (2) - 21 freq whoppers (3) - 1 freq trippers (3) - 2 freq snappers (4) - 2 freq clappers (4) - 12 freq sappers (4) - 2 freq nappers (4) - 6 freq grapplers (4) - 1 freq drapers (4) - 1 freq crampers (4) - 1 freq rapper (4) - 4 freq wrapped (4) - 53 freq wapper (4) - 2 freq drapper (4) - 1 freq wappens (4) - 6 freq lappers (4) - 1 freq chappers (4) - 2 freq stappers (4) - 1 freq slappers (4) - 2 freq crapper (4) - 1 freq flappers (4) - 5 freq scuppers (5) - 1 freq whispers (5) - 44 freq wipers (5) - 4 freq |
SoundEx code - W616 wherever - 10 freq whaurivver - 7 freq wrapper - 21 freq whaurever - 19 freq whauriver - 5 freq wrappers - 8 freq whaurfor - 1 freq whuriver - 1 freq weer-brush - 1 freq whiriver - 2 freq whaarever - 3 freq whaarivir - 1 freq wherefrae - 1 freq whaarivver - 1 freq weirfare - 3 freq whaarivvir - 1 freq whirriver - 1 freq warfare - 1 freq whirever - 1 freq wharivir - 1 freq whariver - 1 freq warburydude - 1 freq warburton - 1 freq whurever - 1 freq were-bairnikie - 1 freq |
MetaPhone code - RPRS wrappers - 8 freq rypers - 1 freq ripper's - 4 freq repairs - 6 freq reapers - 2 freq reaper's - 2 freq rapurs - 2 freq reprise - 1 freq repares - 1 freq repress - 1 freq |
WRAPPERS |
| Time to execute Levenshtein function - 0.184361 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.373404 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.027086 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.037304 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.000881 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. |