| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| whoever (0) - 15 freq whaever (1) - 12 freq whosever (1) - 1 freq who've (2) - 7 freq wheeter (2) - 1 freq 'hooever (2) - 1 freq whatever (2) - 55 freq witever (2) - 2 freq wherever (2) - 10 freq whenever (2) - 77 freq hover (2) - 9 freq wheeler (2) - 4 freq wheer (2) - 20 freq whaeever (2) - 1 freq whurever (2) - 1 freq however (2) - 61 freq whitever (2) - 161 freq wheeker (2) - 25 freq whaiver (2) - 30 freq whirever (2) - 1 freq houever (2) - 37 freq hooever (2) - 31 freq whopper (2) - 3 freq whanever (2) - 8 freq hever (2) - 2 freq |
whoever (0) - 15 freq whaever (1) - 12 freq whaiver (2) - 30 freq whaeever (2) - 1 freq whosever (2) - 1 freq whirever (3) - 1 freq wheeker (3) - 25 freq houever (3) - 37 freq whinever (3) - 3 freq hoover (3) - 18 freq whe'er (3) - 1 freq whitever (3) - 161 freq hever (3) - 2 freq whanever (3) - 8 freq hooever (3) - 31 freq wherever (3) - 10 freq whatever (3) - 55 freq 'hooever (3) - 1 freq wheeter (3) - 1 freq whenever (3) - 77 freq witever (3) - 2 freq wheeler (3) - 4 freq wheer (3) - 20 freq hover (3) - 9 freq whurever (3) - 1 freq |
SoundEx code - W160 whoever - 15 freq whaever - 12 freq wiver - 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 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.192834 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.366528 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.028159 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.046892 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.000864 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. |