| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| hopepunkq (0) - 8 freq honeypunk (3) - 1 freq hopefu (4) - 11 freq homespun (4) - 1 freq hopeful (4) - 10 freq hopein (4) - 1 freq hopefully (4) - 60 freq hoppin (4) - 11 freq hoppened (4) - 1 freq hopen (4) - 1 freq hoopin (5) - 5 freq oppenly (5) - 1 freq happeq (5) - 1 freq happen't (5) - 2 freq heppin (5) - 1 freq openit (5) - 4 freq hoping (5) - 31 freq happence (5) - 1 freq openly (5) - 11 freq hoped (5) - 42 freq happin (5) - 16 freq notebuik (5) - 1 freq heuk (5) - 11 freq open't (5) - 5 freq happing (5) - 1 freq |
hopepunkq (0) - 8 freq honeypunk (5) - 1 freq hoppened (6) - 1 freq hoppin (6) - 11 freq happen (7) - 386 freq hippin (7) - 1 freq happint (7) - 15 freq happent (7) - 194 freq happened (7) - 461 freq hippened (7) - 1 freq happin't (7) - 1 freq heppenin (7) - 1 freq hippins (7) - 3 freq heppens (7) - 4 freq happens (7) - 207 freq hippens (7) - 5 freq heppen (7) - 11 freq happenan (7) - 3 freq happenit (7) - 12 freq happenin (7) - 144 freq heppent (7) - 7 freq happins (7) - 3 freq happinen (7) - 1 freq happnin (7) - 7 freq happan (7) - 2 freq |
SoundEx code - H115 hauf-apen - 2 freq hauf-hopin - 2 freq hauf-opened - 1 freq hivwvens - 1 freq hopepunkq - 8 freq |
MetaPhone code - HPPNKK hopepunkq - 8 freq |
HOPEPUNKQ |
| Time to execute Levenshtein function - 0.317869 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.675575 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.032525 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.086640 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.001064 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. |