| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| hecla (0) - 4 freq hela (1) - 1 freq heelan (2) - 7 freq mela (2) - 3 freq ella (2) - 26 freq heel (2) - 35 freq reca (2) - 6 freq recl (2) - 1 freq hech (2) - 16 freq hecht (2) - 46 freq helga (2) - 1 freq deila (2) - 1 freq hesna (2) - 12 freq hells (2) - 1 freq holla (2) - 1 freq henna (2) - 7 freq dela (2) - 1 freq fecl (2) - 1 freq heera (2) - 3 freq hevna (2) - 8 freq mecca (2) - 5 freq heilan (2) - 17 freq becca (2) - 2 freq hechle (2) - 1 freq heild (2) - 48 freq |
hecla (0) - 4 freq hela (2) - 1 freq heck (3) - 12 freq helli (3) - 2 freq heckle (3) - 2 freq fecl (3) - 1 freq hechle (3) - 1 freq heli (3) - 3 freq he'l (3) - 13 freq helly (3) - 16 freq hello (3) - 48 freq healy (3) - 4 freq hurla (3) - 1 freq heal (3) - 27 freq hellay (3) - 1 freq helle (3) - 6 freq heely (3) - 1 freq heel (3) - 35 freq hel (3) - 15 freq hoola (3) - 2 freq cla (3) - 1 freq hecky (3) - 14 freq recl (3) - 1 freq hech (3) - 16 freq heil (3) - 1 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 - HKL huckle - 11 freq heckle - 2 freq haigle - 1 freq hecla - 4 freq |
HECLA |
| Time to execute Levenshtein function - 0.248969 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.570819 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.028772 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.059769 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.000797 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. |