Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
---|---|---|---|---|
heivenlie (0) - 8 freq haivenlie (1) - 2 freq heivenly (2) - 6 freq heivenis (2) - 1 freq seiventie (2) - 8 freq heiven (3) - 108 freq hivenae (3) - 1 freq bienlie (3) - 2 freq heelie (3) - 3 freq beinlie (3) - 1 freq seiventies (3) - 1 freq seventie (3) - 2 freq heivens (3) - 19 freq heiven's (3) - 5 freq heavenly (3) - 8 freq seivintie (3) - 1 freq seeventie (3) - 1 freq heevenly (3) - 1 freq eidentlie (3) - 3 freq steivelie (3) - 2 freq heichlie (3) - 2 freq heistilie (3) - 1 freq weelie (4) - 3 freq iverie (4) - 73 freq ainerlie (4) - 2 freq |
heivenlie (0) - 8 freq haivenlie (1) - 2 freq heivenly (2) - 6 freq heevenly (3) - 1 freq heivenis (3) - 1 freq heavenly (3) - 8 freq heevinly (4) - 2 freq hevinly (4) - 1 freq heivens (4) - 19 freq heiven (4) - 108 freq hivenae (4) - 1 freq seiventie (4) - 8 freq heaven (5) - 69 freq heevens (5) - 16 freq heivan (5) - 1 freq heivin (5) - 12 freq heaven' (5) - 1 freq hivni (5) - 1 freq havenae (5) - 20 freq evenly (5) - 5 freq heven (5) - 1 freq divinelie (5) - 1 freq haiven (5) - 34 freq haiven' (5) - 1 freq heichlie (5) - 2 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 |
HEIVENLIE |
Time to execute Levenshtein function - 0.361008 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.495047 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.029059 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.038920 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.000856 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. |