| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| onhappie (0) - 1 freq vnhappie (1) - 2 freq nappie (2) - 1 freq happie (2) - 13 freq chappie (2) - 6 freq onhankit (3) - 2 freq bappie (3) - 1 freq shippie (3) - 1 freq unhappt (3) - 1 freq untappit (3) - 1 freq shappin (3) - 5 freq chappin (3) - 69 freq snappit (3) - 32 freq chappit (3) - 45 freq nappies (3) - 9 freq chappil (3) - 2 freq pappie (3) - 1 freq vnlappit (3) - 1 freq oonhappy (3) - 1 freq chippie (3) - 10 freq ehappin (3) - 1 freq shappit (3) - 2 freq unhappy (3) - 10 freq happier (3) - 18 freq cappie (3) - 3 freq |
onhappie (0) - 1 freq vnhappie (2) - 2 freq oonhappy (3) - 1 freq unhappy (3) - 10 freq happie (3) - 13 freq chappie (3) - 6 freq nappie (3) - 1 freq chippie (4) - 10 freq choppie (4) - 6 freq nippie (4) - 6 freq shoppie (4) - 50 freq hippie (4) - 3 freq shippie (4) - 1 freq unhappt (4) - 1 freq wappie (5) - 1 freq drappie (5) - 17 freq napp (5) - 2 freq chappies (5) - 1 freq nappy (5) - 15 freq 'happy (5) - 7 freq clappie (5) - 3 freq unhaps (5) - 1 freq happit (5) - 104 freq chappy (5) - 2 freq €˜unhappie (5) - 1 freq |
SoundEx code - O510 onfaw - 4 freq oonhappy - 1 freq oomph - 4 freq oompa - 1 freq onhappie - 1 freq one-aff - 1 freq omb - 3 freq onby - 1 freq onieb - 1 freq onyb - 1 freq onafi - 1 freq ohhomaob - 1 freq |
MetaPhone code - ONHP oonhappy - 1 freq onhappie - 1 freq |
ONHAPPIE |
| Time to execute Levenshtein function - 0.246009 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.410451 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.033335 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.046436 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.000988 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. |