| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| hopefu (0) - 11 freq hopefou (1) - 1 freq hopeful (1) - 10 freq shopfu (2) - 1 freq howpfu (2) - 20 freq hope (2) - 769 freq hoped (2) - 42 freq foefu (2) - 1 freq hope- (2) - 1 freq hopein (2) - 1 freq hopes (2) - 39 freq hopen (2) - 1 freq hatefu (2) - 5 freq hope't (2) - 1 freq opef (2) - 1 freq doped (3) - 2 freq opera (3) - 11 freq minefu (3) - 1 freq home' (3) - 2 freq honeat (3) - 1 freq hertfu (3) - 1 freq tyrefu (3) - 1 freq nope (3) - 18 freq heu (3) - 1 freq moped (3) - 1 freq |
hopefu (0) - 11 freq hopefou (1) - 1 freq hopeful (2) - 10 freq hopes (3) - 39 freq hopein (3) - 1 freq hatefu (3) - 5 freq hope- (3) - 1 freq hopen (3) - 1 freq opef (3) - 1 freq shopfu (3) - 1 freq hope (3) - 769 freq howpfu (3) - 20 freq hoped (3) - 42 freq hype (4) - 6 freq howif (4) - 1 freq hoopful (4) - 3 freq heedfu (4) - 1 freq hoof (4) - 15 freq hopp (4) - 5 freq hopt (4) - 1 freq helpfu (4) - 21 freq hopin (4) - 85 freq hopit (4) - 6 freq hppyu (4) - 1 freq hyper (4) - 4 freq |
SoundEx code - H110 hopefu - 11 freq hopefou - 1 freq hiphop - 1 freq hippy-hoppy - 1 freq hip-hop - 1 freq haaf-five - 1 freq hyafwvby - 1 freq |
MetaPhone code - HPF howpfu - 20 freq hopefu - 11 freq howpfae - 1 freq hopefou - 1 freq howpfie - 1 freq |
HOPEFU |
| Time to execute Levenshtein function - 0.170523 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.318799 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.027080 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.036561 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.000899 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. |