| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| highly (0) - 17 freq heighly (1) - 1 freq hiely (2) - 1 freq hight (2) - 2 freq lightly (2) - 7 freq highog (2) - 1 freq eithly (2) - 2 freq high' (2) - 1 freq righty (2) - 1 freq sightly (2) - 1 freq highway (2) - 6 freq hugely (2) - 4 freq nighty (2) - 1 freq highs (2) - 1 freq wiggly (2) - 3 freq bigly (2) - 2 freq nightly (2) - 3 freq mighty (2) - 41 freq wigly (2) - 1 freq highwey (2) - 1 freq sighle (2) - 1 freq tightly (2) - 5 freq high (2) - 619 freq richly (2) - 4 freq shiggly (2) - 2 freq |
highly (0) - 17 freq heighly (1) - 1 freq highway (3) - 6 freq sighle (3) - 1 freq hugely (3) - 4 freq highs (3) - 1 freq highwey (3) - 1 freq highe (3) - 1 freq higher (3) - 79 freq hight (3) - 2 freq highog (3) - 1 freq high' (3) - 1 freq high (3) - 619 freq heigh (4) - 7 freq hugh (4) - 87 freq heighlit (4) - 1 freq heigher (4) - 1 freq hegel (4) - 2 freq roughly (4) - 16 freq height (4) - 45 freq hugh' (4) - 1 freq hygh (4) - 1 freq hughie (4) - 107 freq hechle (4) - 1 freq €˜highly (4) - 1 freq |
SoundEx code - H240 hazel - 51 freq hissel - 371 freq huckle - 11 freq highly - 17 freq hassle - 24 freq hisel - 18 freq hisel' - 1 freq his-sel - 3 freq hessel - 9 freq hizsel - 1 freq heezsel - 1 freq hissell - 55 freq hisell - 2 freq hazily - 1 freq hizzle - 3 freq hoose'll - 2 freq hïssel - 33 freq hazll - 1 freq heckle - 2 freq heighly - 1 freq haakhill - 1 freq haigle - 1 freq hegel - 2 freq hushle - 1 freq hizzel - 1 freq heichlie - 2 freq hugely - 4 freq €˜highly - 1 freq howasley - 1 freq hazle - 1 freq hechle - 1 freq hecla - 4 freq hhgqul - 1 freq |
MetaPhone code - HFL huffily - 3 freq highly - 17 freq hauflie - 1 freq 'hevylie - 1 freq hayvul - 1 freq heavily - 9 freq hovel - 4 freq 'hovel' - 1 freq €˜highly - 1 freq |
HIGHLY |
| Time to execute Levenshtein function - 0.266562 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.546756 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.037872 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.038572 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.000876 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. |