| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| whusper (0) - 20 freq whuspert (1) - 57 freq whuspers (1) - 5 freq whisper (1) - 56 freq fusper (2) - 18 freq whupped (2) - 3 freq whispert (2) - 22 freq whuskers (2) - 12 freq whispers (2) - 45 freq thumper (2) - 1 freq whopper (2) - 3 freq whusperin (2) - 10 freq whuther (2) - 21 freq whuspered (2) - 43 freq whispery (2) - 1 freq whispern (2) - 1 freq whisker (2) - 1 freq whuskey (2) - 7 freq whudder (2) - 1 freq whut'er (2) - 1 freq whimper (2) - 13 freq whurever (3) - 1 freq couser (3) - 2 freq whiter (3) - 3 freq whauther (3) - 1 freq |
whusper (0) - 20 freq whisper (1) - 56 freq whuspers (2) - 5 freq whispery (2) - 1 freq whuspert (2) - 57 freq whuspered (3) - 43 freq whispern (3) - 1 freq whimper (3) - 13 freq whusperin (3) - 10 freq whisker (3) - 1 freq whopper (3) - 3 freq whispers (3) - 45 freq whispert (3) - 22 freq whiskery (4) - 1 freq whisperer (4) - 1 freq whusprin (4) - 4 freq whispered (4) - 68 freq whisps (4) - 1 freq whispy (4) - 1 freq whosever (4) - 1 freq whisperan (4) - 5 freq whisperen (4) - 1 freq whisperin (4) - 21 freq whuther (4) - 21 freq whuskers (4) - 12 freq |
SoundEx code - W216 whuspered - 43 freq whisper - 56 freq whispers - 45 freq whispert - 22 freq whuspers - 5 freq whuspert - 57 freq whusper-whusperin - 1 freq whisperin - 21 freq whispered - 68 freq whusper - 20 freq whispery - 1 freq whispereen - 1 freq whispering - 5 freq whisperan - 5 freq whichiver - 1 freq whisperen - 1 freq wisfurgive - 1 freq whusperin - 10 freq whisperins - 2 freq wackford - 1 freq whispern - 1 freq whusprin - 4 freq waashboord - 1 freq whisper't - 2 freq whisperer - 1 freq wexford - 4 freq wwhisperan - 1 freq whosever - 1 freq whasaeiver - 1 freq whisperers - 1 freq whusperins - 1 freq washboard - 1 freq wjprogressive - 10 freq whichever - 1 freq wjoiper - 1 freq |
MetaPhone code - WSPR whisper - 56 freq whusper - 20 freq whispery - 1 freq |
WHUSPER |
| Time to execute Levenshtein function - 0.178501 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.374839 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.028065 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.038120 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.000917 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. |