| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| horrible (0) - 59 freq hoarrible (1) - 1 freq horribly (1) - 2 freq terrible (2) - 136 freq tarrible (2) - 7 freq hornble (2) - 1 freq hostile (3) - 13 freq horrifeed (3) - 3 freq corrie (3) - 55 freq worrie (3) - 3 freq portable (3) - 9 freq horsikie (3) - 1 freq terrile (3) - 1 freq porrige (3) - 1 freq orrie (3) - 3 freq hoarie (3) - 1 freq hornie (3) - 5 freq hourle (3) - 1 freq poasible (3) - 1 freq harrie (3) - 2 freq horrals (3) - 1 freq horrified (3) - 7 freq hourie (3) - 2 freq horrid (3) - 9 freq terribie (3) - 1 freq |
horrible (0) - 59 freq hoarrible (1) - 1 freq horribly (1) - 2 freq hornble (3) - 1 freq tarrible (3) - 7 freq terrible (3) - 136 freq terribly (4) - 5 freq horrific (5) - 7 freq herrie (5) - 2 freq terribie (5) - 1 freq horrid (5) - 9 freq workable (5) - 3 freq gorble (5) - 2 freq hereablo (5) - 1 freq horrified (5) - 7 freq honourable (5) - 8 freq hurriedly (5) - 5 freq heritable (5) - 4 freq hurrie (5) - 1 freq truible (5) - 1 freq thurible (5) - 2 freq forcibly (5) - 2 freq hourle (5) - 1 freq terrile (5) - 1 freq portable (5) - 9 freq |
SoundEx code - H614 hirpled - 20 freq hirplin - 28 freq horrible - 59 freq hirpelt - 2 freq hoarrible - 1 freq hirples - 7 freq hirple - 12 freq hirplit - 5 freq hirpilt - 4 freq hirple's - 1 freq harebells - 2 freq herbal - 5 freq hirpil - 4 freq hirplt - 1 freq herbie'll - 1 freq harebell - 3 freq horribly - 2 freq herbalist - 1 freq hirplet - 1 freq hereablo - 1 freq herobelfast - 1 freq hurple - 1 freq hirplinyowe - 1 freq |
MetaPhone code - HRBL horrible - 59 freq hoarrible - 1 freq herbal - 5 freq herbie'll - 1 freq harebell - 3 freq horribly - 2 freq hereablo - 1 freq |
HORRIBLE |
| Time to execute Levenshtein function - 0.265956 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.420906 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.028553 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.038301 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.000951 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. |