| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| whoever (0) - 15 freq whosever (1) - 1 freq whaever (1) - 12 freq whirever (2) - 1 freq wheeker (2) - 25 freq who've (2) - 8 freq whe'er (2) - 1 freq hoover (2) - 18 freq whinever (2) - 3 freq witever (2) - 2 freq wherever (2) - 11 freq whatever (2) - 57 freq houever (2) - 39 freq whaeever (2) - 1 freq wheer (2) - 20 freq whaiver (2) - 30 freq hooever (2) - 31 freq whurever (2) - 1 freq hover (2) - 9 freq 'hooever (2) - 1 freq hever (2) - 2 freq however (2) - 61 freq whitever (2) - 167 freq whanever (2) - 8 freq whoever's (2) - 1 freq |
whoever (0) - 15 freq whaever (1) - 12 freq whaiver (2) - 30 freq whaeever (2) - 1 freq whosever (2) - 1 freq hover (3) - 9 freq 'hooever (3) - 1 freq whurever (3) - 1 freq hever (3) - 2 freq whenever (3) - 78 freq wheeter (3) - 1 freq wheeler (3) - 4 freq whanever (3) - 8 freq whitever (3) - 167 freq hooever (3) - 31 freq whinever (3) - 3 freq hoover (3) - 18 freq wheer (3) - 20 freq whe'er (3) - 1 freq wheeker (3) - 25 freq witever (3) - 2 freq whirever (3) - 1 freq houever (3) - 39 freq whatever (3) - 57 freq wherever (3) - 11 freq |
SoundEx code - W160 whoever - 15 freq whaever - 12 freq wiver - 1 freq waver - 1 freq whi'evvir - 1 freq whi'evir - 1 freq whaivver - 5 freq whaeever - 1 freq wafer - 2 freq weaver - 12 freq whaiver - 30 freq wha-ivir - 6 freq waffer - 1 freq wyver - 2 freq wapper - 2 freq €œwhaever - 1 freq weber - 1 freq wavery - 1 freq waahfer - 1 freq whopper - 3 freq wyper - 1 freq |
MetaPhone code - WFR whoever - 15 freq whaever - 12 freq wiver - 1 freq waver - 1 freq whi'evvir - 1 freq whi'evir - 1 freq whaivver - 5 freq whaeever - 1 freq wafer - 2 freq weaver - 12 freq whaiver - 30 freq wha-ivir - 6 freq waffer - 1 freq €œwhaever - 1 freq wavery - 1 freq waahfer - 1 freq |
WHOEVER |
| Time to execute Levenshtein function - 0.240823 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.563036 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.029141 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.069357 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.000863 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. |