| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| havered (0) - 7 freq haivered (1) - 2 freq davered (1) - 1 freq hovered (1) - 11 freq covered (2) - 119 freq haver (2) - 6 freq haverin (2) - 24 freq levered (2) - 3 freq hared (2) - 1 freq havers (2) - 35 freq hoovered (2) - 4 freq watered (2) - 5 freq hytered (2) - 3 freq haeted (2) - 1 freq capered (2) - 4 freq hattered (2) - 7 freq hatred (2) - 27 freq haeved (2) - 2 freq revered (2) - 3 freq hankered (2) - 2 freq haerd (2) - 26 freq swavered (2) - 3 freq heered (2) - 2 freq papered (2) - 1 freq ayered (2) - 1 freq |
havered (0) - 7 freq hovered (1) - 11 freq haivered (1) - 2 freq hoovered (2) - 4 freq davered (2) - 1 freq severed (3) - 6 freq kivered (3) - 1 freq heered (3) - 2 freq quavered (3) - 2 freq havert (3) - 1 freq fevered (3) - 1 freq shivered (3) - 6 freq ivered (3) - 4 freq havera (3) - 2 freq dovered (3) - 6 freq haerd (3) - 26 freq hered (3) - 2 freq haired (3) - 5 freq haiverel (3) - 1 freq hared (3) - 1 freq havers (3) - 35 freq haver (3) - 6 freq hytered (3) - 3 freq hatred (3) - 27 freq covered (3) - 119 freq |
SoundEx code - H163 hubbard - 13 freq habbert - 1 freq hauf-roads - 7 freq hubbert - 1 freq hauf-feart - 2 freq havert - 1 freq hebridean - 2 freq hauf-hairtedly - 1 freq hoovered - 4 freq havered - 7 freq hebrides - 14 freq hauf-heartedly - 1 freq hovered - 11 freq hypertensed - 1 freq haavert - 1 freq hauf-heard - 1 freq hybrid - 4 freq hyperdrive - 1 freq haivered - 2 freq hauf-hertit - 1 freq hubbered - 1 freq hauf-brither - 2 freq hauf-hertidly - 1 freq hauf-wrutten - 1 freq hybridisation - 3 freq hebrideanbloss - 4 freq hebrideanrefurb - 1 freq |
MetaPhone code - HFRT havert - 1 freq hoovered - 4 freq havered - 7 freq hovered - 11 freq haavert - 1 freq haivered - 2 freq highroad - 6 freq |
HAVERED |
| Time to execute Levenshtein function - 0.219897 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.366246 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.027437 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.039258 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.000805 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. |