| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| wwhisperan (0) - 1 freq whisperan (1) - 5 freq whisperen (2) - 1 freq whisperin (2) - 21 freq whispern (2) - 1 freq whisperer (3) - 1 freq whispers (3) - 45 freq whisper (3) - 56 freq whispert (3) - 22 freq whispering (3) - 5 freq whusperin (3) - 10 freq whisperins (3) - 2 freq whispereen (3) - 1 freq whispery (3) - 1 freq whispered (3) - 68 freq whimperin (3) - 1 freq whisper't (3) - 2 freq whusper (4) - 20 freq whipman (4) - 3 freq whiterat (4) - 1 freq whiskery (4) - 1 freq whisperers (4) - 1 freq wiseman (4) - 1 freq winderan (4) - 2 freq whisker (4) - 1 freq |
wwhisperan (0) - 1 freq whisperan (2) - 5 freq whispern (3) - 1 freq whisperin (3) - 21 freq whisperen (3) - 1 freq whispereen (4) - 1 freq whusperin (4) - 10 freq whispery (5) - 1 freq whusprin (5) - 4 freq whisperins (5) - 2 freq whimperin (5) - 1 freq whispered (5) - 68 freq whispering (5) - 5 freq whisperer (5) - 1 freq whisper (5) - 56 freq whispers (5) - 45 freq whispert (5) - 22 freq whuspert (6) - 57 freq whuspers (6) - 5 freq whisper't (6) - 2 freq whusperins (6) - 1 freq whuspered (6) - 43 freq whusper (6) - 20 freq whimper (7) - 13 freq whimpered (7) - 7 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 - HSPRN wwhisperan - 1 freq |
WWHISPERAN |
| Time to execute Levenshtein function - 0.213773 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.366527 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.029420 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.039053 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.000966 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. |