| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| whatsoiver (0) - 1 freq whatsoever (1) - 3 freq whitsoivver (2) - 1 freq whitsomiver (2) - 1 freq whativer (2) - 15 freq whitsoever (2) - 3 freq whasaeiver (3) - 1 freq whitsaivver (3) - 1 freq whatever (3) - 57 freq whitiver (3) - 39 freq whutiver (3) - 22 freq whariver (3) - 1 freq whaiver (3) - 30 freq whittiver (3) - 1 freq whaniver (3) - 108 freq whativir (3) - 2 freq whauriver (3) - 5 freq fitsoiver (3) - 1 freq whalloper (4) - 1 freq whitever (4) - 167 freq hanover (4) - 5 freq whateer (4) - 2 freq hoosomiver (4) - 1 freq wharivir (4) - 1 freq whaarivir (4) - 1 freq |
whatsoiver (0) - 1 freq whatsoever (1) - 3 freq whitsoever (2) - 3 freq whativer (3) - 15 freq whitsomiver (3) - 1 freq whitsoivver (3) - 1 freq whittiver (4) - 1 freq whativir (4) - 2 freq whitsaeever (4) - 2 freq whutiver (4) - 22 freq whitiver (4) - 39 freq whasaeiver (4) - 1 freq whitsaivver (4) - 1 freq whatever (4) - 57 freq whitsaeivver (5) - 1 freq whitivir (5) - 9 freq whatewvir (5) - 1 freq whit-ever (5) - 1 freq whosever (5) - 1 freq whitivver (5) - 39 freq whauriver (5) - 5 freq whaniver (5) - 108 freq whaiver (5) - 30 freq whariver (5) - 1 freq whitever (5) - 167 freq |
SoundEx code - W321 wotship - 1 freq widespread - 6 freq whatsoiver - 1 freq whatsappd - 1 freq whitsoever - 3 freq watchfu - 4 freq whatsapp - 9 freq whatsoever - 3 freq whitsaivver - 1 freq whitsaeever - 2 freq whitsoivver - 1 freq witchypoo - 1 freq watchful - 2 freq whitespots - 1 freq widespreid - 4 freq witch-bricht - 1 freq wades-bridge - 1 freq wheat-shaef - 2 freq whitsaeivver - 1 freq widespried - 1 freq whitsup - 1 freq wtqcbp - 1 freq witchiepoo - 1 freq woodwosehapa - 1 freq |
MetaPhone code - WTSFR whatsoiver - 1 freq whitsoever - 3 freq whatsoever - 3 freq whitsaivver - 1 freq whitsaeever - 2 freq whitsoivver - 1 freq whitsaeivver - 1 freq |
WHATSOIVER |
| Time to execute Levenshtein function - 0.252826 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.420322 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.036887 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.049978 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.001211 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. |