| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| hiphop (0) - 1 freq hip-hop (1) - 1 freq skiphop (2) - 1 freq hippos (2) - 1 freq hippo (2) - 3 freq highog (2) - 1 freq chipshop (2) - 1 freq bishop (2) - 15 freq hislop (2) - 3 freq plop (3) - 4 freq highs (3) - 1 freq phrp (3) - 1 freq high (3) - 619 freq ipon (3) - 16 freq ipo (3) - 56 freq ipod (3) - 3 freq €˜shop (3) - 1 freq hop (3) - 16 freq tipp (3) - 1 freq him-how (3) - 1 freq bipoc (3) - 1 freq chop (3) - 25 freq hilltop (3) - 4 freq poop (3) - 3 freq hmph (3) - 1 freq |
hiphop (0) - 1 freq hip-hop (2) - 1 freq hippo (3) - 3 freq php (4) - 1 freq hippy (4) - 4 freq hopp (4) - 5 freq hyphen (4) - 2 freq hippie (4) - 3 freq hislop (4) - 3 freq hippos (4) - 1 freq skiphop (4) - 1 freq highog (4) - 1 freq chipshop (4) - 1 freq bishop (4) - 15 freq happ (4) - 4 freq hight (5) - 2 freq hips (5) - 32 freq hippin (5) - 1 freq zip-up (5) - 1 freq higher (5) - 79 freq highe (5) - 1 freq iphis (5) - 2 freq hither (5) - 6 freq mishap (5) - 3 freq hip (5) - 34 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 - HFP hiphop - 1 freq high-up - 1 freq |
HIPHOP |
| Time to execute Levenshtein function - 0.249231 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.387182 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.028219 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.038237 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.000912 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. |