| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| oonhappy (0) - 1 freq unhappy (2) - 10 freq €™happy (3) - 1 freq nappy (3) - 15 freq ooneasy (3) - 1 freq happy (3) - 764 freq oonaesy (3) - 4 freq chappy (3) - 2 freq €˜happy (3) - 2 freq knappy (3) - 1 freq snappy (3) - 7 freq onhappie (3) - 1 freq oonchancy (3) - 3 freq 'happy (3) - 7 freq unhappt (3) - 1 freq appy (4) - 1 freq nippy (4) - 29 freq tappy (4) - 1 freq hippy (4) - 4 freq ootlay (4) - 1 freq ornary (4) - 1 freq €˜nippy (4) - 3 freq happt (4) - 14 freq concaity (4) - 1 freq onay (4) - 1 freq |
oonhappy (0) - 1 freq unhappy (2) - 10 freq onhappie (3) - 1 freq 'happy (4) - 7 freq chappy (4) - 2 freq unhappt (4) - 1 freq happy (4) - 764 freq nappy (4) - 15 freq choppy (5) - 6 freq haippy (5) - 2 freq napp (5) - 2 freq unhaps (5) - 1 freq vnhappie (5) - 2 freq happ (5) - 4 freq shapp (5) - 1 freq chippy (5) - 38 freq unhap (5) - 2 freq shippy (5) - 1 freq hippy (5) - 4 freq €˜happy (5) - 2 freq knappy (5) - 1 freq snappy (5) - 7 freq €™happy (5) - 1 freq nippy (5) - 29 freq bappy (6) - 27 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 |
OONHAPPY |
| Time to execute Levenshtein function - 0.235515 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.525903 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.062824 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.039032 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.000944 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. |