Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
---|---|---|---|---|
whispery (0) - 1 freq whiskery (1) - 1 freq whispern (1) - 1 freq whisper (1) - 56 freq whispert (1) - 22 freq whispers (1) - 45 freq whuspers (2) - 5 freq whisker (2) - 1 freq whuspert (2) - 57 freq whisperen (2) - 1 freq whispered (2) - 68 freq whisperin (2) - 21 freq whispy (2) - 1 freq whimper (2) - 13 freq whusper (2) - 20 freq whisperan (2) - 5 freq whiskey (2) - 19 freq whimpers (2) - 3 freq whiskers (2) - 22 freq whisper't (2) - 2 freq whisperer (2) - 1 freq whimperin (3) - 1 freq thievery (3) - 1 freq whoppers (3) - 1 freq whitley (3) - 1 freq |
whispery (0) - 1 freq whisper (1) - 56 freq whusper (2) - 20 freq whispert (2) - 22 freq whispers (2) - 45 freq whispern (2) - 1 freq whiskery (2) - 1 freq whimper (3) - 13 freq whisperan (3) - 5 freq whisperer (3) - 1 freq whispy (3) - 1 freq whispered (3) - 68 freq whisperin (3) - 21 freq whuspers (3) - 5 freq whisker (3) - 1 freq whuspert (3) - 57 freq whisperen (3) - 1 freq whuspered (4) - 43 freq whisps (4) - 1 freq whispereen (4) - 1 freq whopper (4) - 3 freq whiskey (4) - 19 freq whusperin (4) - 10 freq whiskers (4) - 22 freq whimpers (4) - 3 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 |
WHISPERY |
Time to execute Levenshtein function - 0.226715 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.347564 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.027567 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.040355 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.001077 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. |