| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| heevinly (0) - 2 freq hevinly (1) - 1 freq heevenly (1) - 1 freq heevins (2) - 4 freq seeminly (2) - 17 freq heavenly (2) - 8 freq heavily (2) - 9 freq ceevilly (2) - 5 freq heevin (2) - 9 freq eeevilly (2) - 1 freq heivenly (2) - 6 freq leevin's (3) - 1 freq heefin (3) - 1 freq cheerily (3) - 5 freq hertitly (3) - 1 freq seevin' (3) - 2 freq weevils (3) - 1 freq haevins (3) - 1 freq lovinly (3) - 2 freq hertily (3) - 2 freq seevin (3) - 27 freq ceevil (3) - 45 freq heely (3) - 1 freq leeving (3) - 1 freq steminly (3) - 1 freq |
heevinly (0) - 2 freq heevenly (1) - 1 freq hevinly (1) - 1 freq heavenly (2) - 8 freq heivenly (2) - 6 freq heevin (3) - 9 freq heevins (3) - 4 freq heavily (3) - 9 freq hivvenly (4) - 6 freq heeven (4) - 12 freq heaving (4) - 1 freq heivin (4) - 12 freq haevin (4) - 2 freq hevin (4) - 20 freq evenly (4) - 5 freq heivins (4) - 2 freq hievins (4) - 1 freq heving (4) - 1 freq heavin (4) - 18 freq heevens (4) - 16 freq heivenlie (4) - 8 freq hevins (4) - 1 freq eeevilly (4) - 1 freq ceevilly (4) - 5 freq seeminly (4) - 17 freq |
SoundEx code - H154 heivenlie - 8 freq heivenly - 6 freq hippin'll - 1 freq heavenly - 8 freq hauf-a-mile - 1 freq hauf-fameeliar - 1 freq haivenlie - 2 freq hivvenly - 6 freq heevinly - 2 freq heevenly - 1 freq hevinly - 1 freq haaf-familiar - 1 freq hobnail - 2 freq heavenlydancer - 2 freq heavenlydancers - 2 freq hbmyhl - 1 freq heavenlyink - 2 freq |
MetaPhone code - HFNL heivenlie - 8 freq heivenly - 6 freq heavenly - 8 freq haivenlie - 2 freq hivvenly - 6 freq heevinly - 2 freq heevenly - 1 freq hevinly - 1 freq |
HEEVINLY |
| Time to execute Levenshtein function - 0.379169 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.586484 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.028338 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.085595 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.001039 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. |