| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| hip-hop (0) - 1 freq hiphop (1) - 1 freq hic-hoc (2) - 1 freq chipshop (2) - 1 freq him-how (2) - 1 freq bishop (3) - 15 freq chip-shoap (3) - 1 freq hap-nap (3) - 1 freq chopchop (3) - 1 freq ho-ho (3) - 9 freq zip-up (3) - 1 freq rid-hot (3) - 5 freq hilltop (3) - 3 freq shit-hot (3) - 1 freq him-hit (3) - 1 freq hippos (3) - 1 freq highog (3) - 1 freq hippo (3) - 3 freq 'im-how (3) - 1 freq skiphop (3) - 1 freq hi-doh (3) - 6 freq hislop (3) - 3 freq tip-tap (3) - 3 freq timehop (3) - 1 freq chop-chop (3) - 1 freq |
hip-hop (0) - 1 freq hiphop (2) - 1 freq hap-nap (4) - 1 freq him-how (4) - 1 freq chipshop (4) - 1 freq hic-hoc (4) - 1 freq hippo (5) - 3 freq tip-tap (5) - 3 freq chop-chop (5) - 1 freq zip-up (5) - 1 freq him-hit (5) - 1 freq ho-ho (5) - 9 freq chip-shoap (5) - 1 freq chopchop (5) - 1 freq hippy (6) - 4 freq pup-pup (6) - 1 freq happ (6) - 4 freq hippie (6) - 2 freq hoidy-hol (6) - 1 freq chap-chap (6) - 1 freq heidship (6) - 1 freq heirship (6) - 6 freq hie-heid (6) - 3 freq ship-shape (6) - 1 freq hail-hek (6) - 1 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 - HPHP hippy-hoppy - 1 freq hip-hop - 1 freq |
HIP-HOP |
| Time to execute Levenshtein function - 0.215355 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.604497 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.031743 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.037640 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.000765 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. |