| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| havers (0) - 35 freq haivers (1) - 31 freq haters (1) - 1 freq wavers (1) - 1 freq havera (1) - 2 freq hovers (1) - 3 freq haver (1) - 6 freq savers (1) - 1 freq 'havers (1) - 1 freq havert (1) - 1 freq cavers (1) - 6 freq havens (1) - 1 freq haimers (2) - 2 freq hatters (2) - 5 freq baters (2) - 2 freq hapens (2) - 1 freq havins (2) - 1 freq save's (2) - 1 freq hairs (2) - 35 freq caves (2) - 16 freq halves (2) - 1 freq davert (2) - 1 freq hangers (2) - 1 freq clavers (2) - 15 freq haerts (2) - 19 freq |
havers (0) - 35 freq haivers (1) - 31 freq hovers (1) - 3 freq havert (2) - 1 freq havens (2) - 1 freq savers (2) - 1 freq cavers (2) - 6 freq 'havers (2) - 1 freq haters (2) - 1 freq wavers (2) - 1 freq havera (2) - 2 freq haver (2) - 6 freq levers (3) - 6 freq chivers (3) - 1 freq beavers (3) - 2 freq livers (3) - 1 freq haiver (3) - 6 freq heaves (3) - 2 freq hauners (3) - 6 freq hikers (3) - 2 freq averse (3) - 6 freq hers (3) - 84 freq hooers (3) - 2 freq weavers (3) - 9 freq heers (3) - 2 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 |
HAVERS |
| Time to execute Levenshtein function - 0.176190 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.341172 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.027355 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.037392 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.000803 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. |