| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| hugely (0) - 4 freq ugly (2) - 69 freq gely (2) - 2 freq hugest (2) - 1 freq halely (2) - 7 freq hamely (2) - 45 freq heely (2) - 1 freq rudely (2) - 3 freq hurly (2) - 4 freq sagely (2) - 2 freq highly (2) - 17 freq huily (2) - 2 freq surely (2) - 179 freq hummly (2) - 1 freq shurely (2) - 3 freq luvely (2) - 9 freq sugery (2) - 1 freq hiely (2) - 1 freq huey (2) - 31 freq huge (2) - 96 freq gudely (2) - 1 freq humbly (2) - 6 freq huggy (2) - 2 freq hegel (2) - 2 freq homely (2) - 2 freq |
hugely (0) - 4 freq hegel (2) - 2 freq sagely (3) - 2 freq highly (3) - 17 freq huggy (3) - 2 freq huge (3) - 96 freq hiely (3) - 1 freq huily (3) - 2 freq hurly (3) - 4 freq gely (3) - 2 freq ugly (3) - 69 freq heely (3) - 1 freq homely (3) - 2 freq hamely (3) - 45 freq halely (3) - 7 freq gyely (4) - 52 freq hugh (4) - 87 freq bugil (4) - 1 freq healy (4) - 4 freq haley (4) - 1 freq hull (4) - 30 freq hel (4) - 15 freq angelo (4) - 1 freq hly (4) - 1 freq haunel (4) - 3 freq |
SoundEx code - H240 hazel - 51 freq hissel - 371 freq huckle - 11 freq highly - 17 freq hassle - 20 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 - HJL hegel - 2 freq hugely - 4 freq |
HUGELY |
| Time to execute Levenshtein function - 0.201914 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.335141 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.027808 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.039117 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.001134 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. |