| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| hovered (0) - 11 freq dovered (1) - 6 freq covered (1) - 119 freq hoovered (1) - 4 freq havered (1) - 7 freq pooered (2) - 3 freq pouered (2) - 4 freq coveted (2) - 4 freq shivered (2) - 6 freq couered (2) - 1 freq revered (2) - 3 freq kivered (2) - 1 freq sobered (2) - 1 freq heered (2) - 2 freq hoverin (2) - 22 freq touered (2) - 1 freq tooered (2) - 1 freq honeyed (2) - 1 freq fevered (2) - 1 freq davered (2) - 1 freq pokered (2) - 1 freq hoved (2) - 4 freq jowered (2) - 1 freq hover (2) - 9 freq hoveran (2) - 1 freq |
hovered (0) - 11 freq hoovered (1) - 4 freq havered (1) - 7 freq covered (2) - 119 freq haivered (2) - 2 freq dovered (2) - 6 freq hover (3) - 9 freq hoved (3) - 4 freq hoveran (3) - 1 freq hytered (3) - 3 freq hovers (3) - 3 freq ivered (3) - 4 freq hered (3) - 2 freq fevered (3) - 1 freq levered (3) - 3 freq severed (3) - 6 freq davered (3) - 1 freq kivered (3) - 1 freq revered (3) - 3 freq shivered (3) - 6 freq hoverin (3) - 22 freq heered (3) - 2 freq hared (4) - 1 freq heared (4) - 14 freq veered (4) - 6 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 |
HOVERED |
| Time to execute Levenshtein function - 0.251376 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.381446 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.027145 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.042730 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.001144 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. |