| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| haivers (0) - 31 freq haiver (1) - 6 freq haivens (1) - 2 freq taivers (1) - 3 freq 'haivers (1) - 4 freq haimers (1) - 2 freq havers (1) - 35 freq givers (2) - 2 freq haimer (2) - 2 freq shivers (2) - 14 freq hackers (2) - 1 freq kivers (2) - 3 freq raiders (2) - 4 freq haufers (2) - 4 freq paipers (2) - 5 freq maiters (2) - 28 freq fivers (2) - 3 freq reivers (2) - 17 freq havens (2) - 1 freq haters (2) - 1 freq sairvers (2) - 1 freq savers (2) - 1 freq whaiver's (2) - 2 freq hauders (2) - 3 freq hammers (2) - 6 freq |
haivers (0) - 31 freq havers (1) - 35 freq haivens (2) - 2 freq haiver (2) - 6 freq hovers (2) - 3 freq haimers (2) - 2 freq taivers (2) - 3 freq 'haivers (2) - 4 freq heifers (3) - 2 freq vivers (3) - 1 freq haivered (3) - 2 freq 'havers (3) - 1 freq wavers (3) - 1 freq havera (3) - 2 freq veivers (3) - 1 freq hanovers (3) - 1 freq heivens (3) - 19 freq haver (3) - 6 freq cavers (3) - 6 freq livers (3) - 1 freq haiverin (3) - 18 freq haiverers (3) - 1 freq haavert (3) - 1 freq quivers (3) - 1 freq haiverel (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 |
HAIVERS |
| Time to execute Levenshtein function - 0.308112 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.591962 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.027845 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.077689 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.000828 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. |