| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| hovers (0) - 3 freq rovers (1) - 23 freq hover (1) - 9 freq lovers (1) - 20 freq covers (1) - 50 freq overs (1) - 2 freq havers (1) - 35 freq hooers (1) - 2 freq hovels (1) - 1 freq hooer (2) - 2 freq dover (2) - 15 freq loves (2) - 63 freq comers (2) - 1 freq havens (2) - 1 freq losers (2) - 3 freq howders (2) - 2 freq haivers (2) - 31 freq love's (2) - 12 freq hanovers (2) - 1 freq hever (2) - 2 freq novels (2) - 29 freq sover (2) - 1 freq lover (2) - 27 freq convers (2) - 1 freq shouers (2) - 1 freq |
hovers (0) - 3 freq havers (1) - 35 freq hooers (2) - 2 freq haivers (2) - 31 freq rovers (2) - 23 freq hovels (2) - 1 freq lovers (2) - 20 freq hover (2) - 9 freq covers (2) - 50 freq overs (2) - 2 freq kivers (3) - 3 freq syvers (3) - 2 freq livers (3) - 1 freq haver (3) - 6 freq divers (3) - 10 freq luvers (3) - 12 freq wavers (3) - 1 freq savers (3) - 1 freq hooters (3) - 3 freq givers (3) - 2 freq hoveran (3) - 1 freq chivers (3) - 1 freq hoverin (3) - 22 freq hoors (3) - 49 freq vivers (3) - 1 freq |
SoundEx code - H162 havers - 35 freq haivers - 31 freq hey-forks - 1 freq 'havers - 1 freq 'haivers - 4 freq heifers - 2 freq hubris - 1 freq hauf-price - 2 freq haufers - 4 freq habbers - 1 freq hyperspace - 1 freq hovers - 3 freq hoover's - 1 freq hypercorrection - 3 freq €œhavers - 2 freq hypercorrect - 1 freq hyper-cranreuch - 1 freq hubristic - 1 freq hypersensitive - 1 freq haversack - 1 freq hprjx - 1 freq haiversblog - 1 freq heffers - 1 freq heefers - 1 freq hippyrockchick - 12 freq hburgh - 1 freq hauf-ersed - 1 freq |
MetaPhone code - HFRS havers - 35 freq haivers - 31 freq high-rise - 4 freq 'havers - 1 freq 'haivers - 4 freq heifers - 2 freq highers - 12 freq haufers - 4 freq hovers - 3 freq hoover's - 1 freq highrise - 2 freq €œhavers - 2 freq heffers - 1 freq heefers - 1 freq |
HOVERS |
| Time to execute Levenshtein function - 0.205798 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.348361 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.027366 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.037935 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.000964 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. |