| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| whereupon (0) - 1 freq whereon (2) - 1 freq wheepin (3) - 3 freq thereon (3) - 1 freq whereat (4) - 1 freq therepy (4) - 1 freq wheengin (4) - 3 freq wheeoo (4) - 1 freq wheelin (4) - 12 freq herein (4) - 7 freq where's (4) - 30 freq heron (4) - 13 freq wheelan (4) - 1 freq sherpin (4) - 1 freq wharein (4) - 1 freq where've (4) - 3 freq where'er (4) - 3 freq cheepin (4) - 6 freq where'd (4) - 3 freq where- (4) - 2 freq thereof (4) - 5 freq weapon (4) - 18 freq weeren (4) - 1 freq respon (4) - 1 freq whered (4) - 1 freq |
whereupon (0) - 1 freq whereon (3) - 1 freq wheepin (4) - 3 freq threapin (5) - 20 freq sherpen (5) - 2 freq sherpin (5) - 1 freq threipin (5) - 10 freq thereon (5) - 1 freq wharein (5) - 1 freq wermyon (6) - 1 freq therein (6) - 3 freq weepin (6) - 1 freq wheezin (6) - 8 freq wherever (6) - 11 freq wheen (6) - 829 freq wherefrae (6) - 1 freq wheep (6) - 8 freq whorlin (6) - 1 freq wheezeen (6) - 1 freq whereas (6) - 8 freq wheres (6) - 9 freq wheeps (6) - 1 freq there-in (6) - 1 freq repon (6) - 8 freq whurlan (6) - 1 freq |
SoundEx code - W615 wrappin - 16 freq wrapping - 6 freq warpaint - 1 freq wrappin-paper - 1 freq war-paint - 1 freq wharvin - 1 freq wire-baned - 1 freq wrappan - 1 freq whereupon - 1 freq warpin - 2 freq wrappin' - 1 freq wrappin - 2 freq werbeing - 2 freq |
MetaPhone code - WRPN whereupon - 1 freq warpin - 2 freq |
WHEREUPON |
| Time to execute Levenshtein function - 0.204399 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.368507 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.033064 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.037916 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.000934 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. |