| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| happenin (0) - 1 freq happenins (2) - 10 freq happening (2) - 25 freq happenin (2) - 144 freq happenings (2) - 3 freq appenin (3) - 3 freq happenen (3) - 2 freq heppenin (3) - 1 freq happnin (3) - 7 freq heppenins (3) - 1 freq happenit (3) - 12 freq happenan (3) - 3 freq happint (4) - 15 freq sharpenin (4) - 3 freq lippenin (4) - 29 freq listenin (4) - 2 freq happin't (4) - 1 freq spewin (4) - 1 freq oppenin (4) - 6 freq lapperin (4) - 1 freq apenin (4) - 10 freq happened's (4) - 1 freq mairnin (4) - 1 freq ha'penny (4) - 3 freq happen't (4) - 2 freq |
happenin (0) - 1 freq happenings (4) - 3 freq happenin (4) - 144 freq happening (4) - 25 freq happenins (4) - 10 freq heppenins (5) - 1 freq happenan (5) - 3 freq happnin (5) - 7 freq happenen (5) - 2 freq heppenin (5) - 1 freq helpin (6) - 1 freq happinen (6) - 1 freq happeneens (6) - 2 freq happenit (6) - 12 freq appenin (6) - 3 freq happing (7) - 1 freq happent (7) - 194 freq happence (7) - 1 freq happen (7) - 386 freq wrappin (7) - 2 freq happend (7) - 1 freq happneen (7) - 1 freq happneens (7) - 1 freq dependin (7) - 1 freq happens (7) - 207 freq |
SoundEx code - H155 happenin - 144 freq happening - 25 freq hauf-muin - 1 freq 'happnin - 1 freq happnin - 7 freq hauf-a-meenit - 1 freq happenins - 10 freq happinen - 1 freq happenen - 2 freq hapnan - 2 freq heppenin - 1 freq hauf-human - 1 freq happeneens - 2 freq happenan - 3 freq happneen - 1 freq happneens - 1 freq happenings - 3 freq hauf-myndit - 1 freq hype-men - 1 freq hippomenes - 31 freq heppenins - 1 freq happenin - 1 freq |
MetaPhone code - HPNN happenin - 144 freq 'happnin - 1 freq happnin - 7 freq happinen - 1 freq happenen - 2 freq hapnan - 2 freq heppenin - 1 freq happenan - 3 freq happneen - 1 freq happenin - 1 freq |
HAPPENIN |
| Time to execute Levenshtein function - 0.874291 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.318110 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.087391 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.105517 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.001157 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. |