| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| hap-nap (0) - 1 freq hapnan (2) - 2 freq hap- (3) - 1 freq na-na (3) - 1 freq hauna (3) - 5 freq havena' (3) - 1 freq happan (3) - 2 freq laptoap (3) - 1 freq hasna (3) - 29 freq had'nae (3) - 1 freq hasnae (3) - 43 freq hav'nae (3) - 1 freq haenna (3) - 3 freq hapens (3) - 1 freq havnae (3) - 23 freq hannah (3) - 10 freq haesna (3) - 53 freq havena (3) - 2 freq a-tap (3) - 1 freq happenan (3) - 3 freq chap-chap (3) - 1 freq laptap (3) - 1 freq haena (3) - 49 freq hausna (3) - 1 freq haesnae (3) - 16 freq |
hap-nap (0) - 1 freq hip-hop (4) - 1 freq hapnan (4) - 2 freq happnin (5) - 7 freq hapens (5) - 1 freq happenan (5) - 3 freq happ (5) - 4 freq tip-tap (5) - 3 freq hap- (5) - 1 freq happan (5) - 2 freq happy (6) - 764 freq happenin (6) - 144 freq happins (6) - 3 freq happened (6) - 461 freq happinen (6) - 1 freq happens (6) - 207 freq happing (6) - 1 freq hopen (6) - 1 freq hopp (6) - 5 freq hpny (6) - 1 freq happneen (6) - 1 freq hae-in (6) - 1 freq hopan (6) - 6 freq happend (6) - 1 freq happint (6) - 15 freq |
SoundEx code - H151 hobnobbin - 2 freq hauf-empty - 1 freq hap-nap - 1 freq hobnob - 2 freq havenport - 1 freq hafnvagr - 1 freq |
MetaPhone code - HPNP hap-nap - 1 freq |
HAP-NAP |
| Time to execute Levenshtein function - 0.532459 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 - 1.273782 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.099541 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.101403 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.007937 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. |