| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| havent (0) - 3 freq havena (1) - 2 freq haven't (1) - 19 freq havens (1) - 1 freq haven (1) - 19 freq havert (1) - 1 freq heven't (2) - 1 freq havin (2) - 67 freq dazent (2) - 1 freq havin' (2) - 1 freq anent (2) - 516 freq hatet (2) - 9 freq caven (2) - 1 freq hayen (2) - 13 freq hapens (2) - 1 freq havenae (2) - 20 freq haunt (2) - 28 freq shaven (2) - 2 freq ladent (2) - 1 freq event (2) - 103 freq caveat (2) - 1 freq hamelt (2) - 72 freq favert (2) - 1 freq advent (2) - 8 freq faent (2) - 2 freq |
havent (0) - 3 freq havert (2) - 1 freq havens (2) - 1 freq haven (2) - 19 freq haven't (2) - 19 freq havena (2) - 2 freq haint (3) - 3 freq vent (3) - 6 freq hasnt (3) - 1 freq havn (3) - 2 freq havana (3) - 1 freq havna (3) - 2 freq hent (3) - 6 freq haavert (3) - 1 freq hven (3) - 1 freq heaven' (3) - 1 freq havena' (3) - 1 freq invent (3) - 11 freq advent (3) - 8 freq haiven' (3) - 1 freq haiven (3) - 34 freq avant (3) - 1 freq event (3) - 103 freq having (3) - 59 freq heven (3) - 1 freq |
SoundEx code - H153 happened - 445 freq hivn't - 1 freq haippent - 1 freq haven't - 19 freq happent - 194 freq happen't - 2 freq heaven-taught - 1 freq happint - 15 freq heivenwatds - 1 freq happin't - 1 freq hypnotizing - 1 freq hauf-mad - 1 freq hypnotic - 4 freq hypnotise - 1 freq hypnotised - 6 freq happenit - 12 freq heven't - 1 freq heppent - 7 freq happened's - 1 freq hauf-pint - 1 freq hypnotisin - 1 freq hauf-panned - 1 freq hauf-mete - 1 freq hippened - 1 freq hie-bendit - 1 freq haifand - 1 freq hypnotising - 1 freq 'heaven-taught' - 1 freq hypnotized - 1 freq happend - 1 freq hoppened - 1 freq huband - 1 freq happymothersday - 4 freq hopintaeappearoanthenews - 1 freq havent - 3 freq |
MetaPhone code - HFNT hivn't - 1 freq haven't - 19 freq heven't - 1 freq haifand - 1 freq havent - 3 freq |
HAVENT |
| Time to execute Levenshtein function - 0.217327 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.347861 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.027768 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.040832 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.000887 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. |