| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| hopefu (0) - 11 freq hopefou (1) - 1 freq hopeful (1) - 10 freq hatefu (2) - 5 freq hope- (2) - 1 freq shopfu (2) - 1 freq foefu (2) - 1 freq hopein (2) - 1 freq hope (2) - 756 freq hopen (2) - 1 freq hope't (2) - 1 freq hopes (2) - 37 freq opef (2) - 1 freq howpfu (2) - 20 freq hoped (2) - 42 freq hopefully (3) - 59 freq rope's (3) - 1 freq roped (3) - 1 freq hop (3) - 13 freq holey (3) - 4 freq choped (3) - 2 freq hooped (3) - 1 freq howfs (3) - 6 freq home (3) - 273 freq honeat (3) - 1 freq |
hopefu (0) - 11 freq hopefou (1) - 1 freq hopeful (2) - 10 freq hopes (3) - 37 freq hopen (3) - 1 freq hoped (3) - 42 freq hope (3) - 756 freq opef (3) - 1 freq howpfu (3) - 20 freq hopein (3) - 1 freq hope- (3) - 1 freq hatefu (3) - 5 freq shopfu (3) - 1 freq hype (4) - 6 freq halpfu (4) - 1 freq hopt (4) - 1 freq howif (4) - 1 freq hef (4) - 1 freq hops (4) - 2 freq houff (4) - 3 freq hopit (4) - 2 freq helpfu (4) - 21 freq hof (4) - 1 freq heedfu (4) - 1 freq haunfu (4) - 8 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.171370 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.311103 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.027673 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.036657 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.000832 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. |