| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| heivenly (0) - 6 freq heevenly (1) - 1 freq heavenly (1) - 8 freq heevinly (2) - 2 freq seiventy (2) - 3 freq heiven's (2) - 5 freq heivens (2) - 19 freq heivenis (2) - 1 freq heiven (2) - 109 freq hevinly (2) - 1 freq heivenlie (2) - 8 freq evenly (2) - 5 freq hivvenly (2) - 6 freq keenly (3) - 8 freq haiven' (3) - 1 freq haiven (3) - 34 freq heavey (3) - 1 freq seiventh (3) - 2 freq steively (3) - 1 freq cliverly (3) - 1 freq heiden (3) - 1 freq haivens (3) - 2 freq heivan (3) - 1 freq heven't (3) - 1 freq seyventy (3) - 1 freq |
heivenly (0) - 6 freq heavenly (1) - 8 freq heevenly (1) - 1 freq heivenlie (2) - 8 freq hevinly (2) - 1 freq heevinly (2) - 2 freq evenly (3) - 5 freq haivenlie (3) - 2 freq hivvenly (3) - 6 freq heivens (3) - 19 freq heivenis (3) - 1 freq heiven (3) - 109 freq heevens (4) - 16 freq heavens (4) - 19 freq heivan (4) - 1 freq heaven (4) - 69 freq heven (4) - 1 freq heeven (4) - 12 freq haivens (4) - 2 freq heaven' (4) - 1 freq haiven (4) - 34 freq haiven' (4) - 1 freq heavily (4) - 9 freq heiven's (4) - 5 freq seiventy (4) - 3 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 |
HEIVENLY |
| Time to execute Levenshtein function - 0.220293 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.392805 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.030250 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.043951 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.001025 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. |