| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| heavily (0) - 8 freq heavies (2) - 5 freq heavy (2) - 192 freq healy (2) - 4 freq heevinly (2) - 2 freq heavenly (2) - 8 freq wearily (2) - 1 freq heavey (2) - 1 freq peavly (2) - 4 freq heavit (2) - 2 freq hevinly (2) - 1 freq hazily (2) - 1 freq haily (2) - 27 freq heavie (2) - 1 freq readily (2) - 7 freq heaving (2) - 1 freq easily (2) - 59 freq heavin (2) - 17 freq hertily (2) - 2 freq heavier (2) - 9 freq headin (3) - 45 freq eivill (3) - 1 freq havin' (3) - 1 freq hamilt (3) - 1 freq weevils (3) - 1 freq |
heavily (0) - 8 freq hazily (3) - 1 freq heavit (3) - 2 freq haily (3) - 27 freq heavie (3) - 1 freq heavier (3) - 9 freq heavin (3) - 17 freq peavly (3) - 4 freq hevinly (3) - 1 freq heavies (3) - 5 freq heavy (3) - 192 freq heavey (3) - 1 freq healy (3) - 4 freq heavenly (3) - 8 freq heevinly (3) - 2 freq kevil (4) - 1 freq heile (4) - 1 freq halely (4) - 7 freq hamely (4) - 45 freq deevil (4) - 17 freq havy (4) - 2 freq haurly (4) - 16 freq heevenly (4) - 1 freq haly (4) - 60 freq haill (4) - 411 freq |
SoundEx code - H140 huffily - 3 freq happily - 40 freq hauflie - 1 freq 'hevylie - 1 freq hayvul - 1 freq howpfully - 6 freq heavily - 8 freq hoopful - 3 freq habile - 6 freq hovel - 4 freq 'hovel' - 1 freq habble - 2 freq happilie - 1 freq howpfullie - 1 freq hubble - 3 freq habbil - 1 freq hoopfully - 2 freq hvl - 2 freq |
MetaPhone code - HFL huffily - 3 freq highly - 17 freq hauflie - 1 freq 'hevylie - 1 freq hayvul - 1 freq heavily - 8 freq hovel - 4 freq 'hovel' - 1 freq €˜highly - 1 freq |
HEAVILY |
| Time to execute Levenshtein function - 0.222463 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.378052 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.027269 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.036807 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.000850 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. |