| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| unhappy (0) - 10 freq unhappt (1) - 1 freq €™happy (2) - 1 freq nappy (2) - 15 freq snappy (2) - 7 freq happy (2) - 764 freq knappy (2) - 1 freq chappy (2) - 2 freq oonhappy (2) - 1 freq 'happy (2) - 7 freq unhaps (2) - 1 freq unhap (2) - 2 freq untappd (2) - 1 freq €˜happy (2) - 2 freq uncanny (3) - 9 freq vnhappie (3) - 2 freq scrappy (3) - 4 freq happ (3) - 4 freq chippy (3) - 38 freq crappy (3) - 6 freq sappy (3) - 19 freq yappy (3) - 1 freq happs (3) - 2 freq unhailly (3) - 1 freq uphaly (3) - 1 freq |
unhappy (0) - 10 freq oonhappy (2) - 1 freq unhappt (2) - 1 freq 'happy (3) - 7 freq unhap (3) - 2 freq unhaps (3) - 1 freq chappy (3) - 2 freq nappy (3) - 15 freq onhappie (3) - 1 freq happy (3) - 764 freq hippy (4) - 4 freq chippy (4) - 38 freq shapp (4) - 1 freq napp (4) - 2 freq happ (4) - 4 freq shippy (4) - 1 freq untappd (4) - 1 freq knappy (4) - 1 freq snappy (4) - 7 freq €™happy (4) - 1 freq nippy (4) - 29 freq €˜happy (4) - 2 freq vnhappie (4) - 2 freq choppy (4) - 6 freq haippy (4) - 2 freq |
SoundEx code - U510 unhappy - 10 freq unwyve - 2 freq unhap - 2 freq €˜unhappie - 1 freq uymihoowhv - 1 freq |
MetaPhone code - UNHP unhappy - 10 freq unhap - 2 freq €˜unhappie - 1 freq |
UNHAPPY |
| Time to execute Levenshtein function - 0.183766 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.364629 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.027345 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.039035 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.000889 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. |