| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| haiversblog (0) - 1 freq haiverel (4) - 1 freq haivers (4) - 32 freq uviversal (5) - 1 freq haivered (5) - 2 freq haversack (5) - 1 freq aversion (5) - 4 freq havers (5) - 35 freq haiver (5) - 6 freq haimers (5) - 2 freq iverson (5) - 1 freq taivers (5) - 3 freq 'haivers (5) - 4 freq universally (5) - 5 freq havering (5) - 2 freq haersel (5) - 1 freq universal (5) - 47 freq haiverers (5) - 1 freq heivens'll (5) - 1 freq taiversome (5) - 2 freq haiverins (5) - 2 freq haivenlie (5) - 2 freq haivens (5) - 2 freq taivert-lke (5) - 1 freq haiverin (5) - 18 freq |
haiversblog (0) - 1 freq haivers (7) - 32 freq haiverel (7) - 1 freq heivens'll (8) - 1 freq universal (8) - 47 freq havering (8) - 2 freq reversible (8) - 1 freq universally (8) - 5 freq havers (8) - 35 freq haversack (8) - 1 freq uviversal (8) - 1 freq haersel (8) - 1 freq hersell (9) - 12 freq hirseled (9) - 1 freq harsing (9) - 1 freq hovers (9) - 3 freq herself (9) - 41 freq hereablo (9) - 1 freq universality (9) - 1 freq reversal (9) - 1 freq adverbial (9) - 1 freq hirselin (9) - 1 freq hairstyles (9) - 2 freq hoovering (9) - 2 freq hovering (9) - 7 freq |
SoundEx code - H162 havers - 35 freq haivers - 32 freq hey-forks - 1 freq heifers - 4 freq 'havers - 1 freq 'haivers - 4 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 - HFRSBLK haiversblog - 1 freq |
HAIVERSBLOG |
| Time to execute Levenshtein function - 0.235110 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.414379 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.027777 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.039907 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.001113 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. |