| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| hippomenes (0) - 31 freq hippened (3) - 1 freq hipbones (3) - 1 freq hippens (3) - 5 freq happienes (3) - 3 freq lippens (4) - 24 freq opponents (4) - 9 freq happened (4) - 445 freq heppens (4) - 4 freq hippies (4) - 6 freq happens (4) - 204 freq happenen (4) - 2 freq happneens (4) - 1 freq hermogenes (4) - 2 freq lippened (4) - 11 freq haippens (4) - 2 freq hippolytus (4) - 2 freq iphones (4) - 2 freq pippens (4) - 1 freq hoppened (4) - 1 freq hippins (4) - 3 freq wilsomeness (4) - 1 freq diomedes (4) - 10 freq hippos (4) - 1 freq homeless (5) - 3 freq |
hippomenes (0) - 31 freq happienes (4) - 3 freq hippens (4) - 5 freq haippens (5) - 2 freq happneens (5) - 1 freq hippins (5) - 3 freq happens (5) - 204 freq heppens (5) - 4 freq hippened (5) - 1 freq hipbones (5) - 1 freq hoppened (6) - 1 freq pippens (6) - 1 freq happins (6) - 3 freq heppenins (6) - 1 freq happenins (6) - 10 freq hippos (6) - 1 freq happeneens (6) - 2 freq hippolytus (6) - 2 freq hippies (6) - 6 freq happenen (6) - 2 freq lippens (6) - 24 freq happened (6) - 445 freq haippent (7) - 1 freq happiness (7) - 56 freq happenan (7) - 3 freq |
SoundEx code - H155 happenin - 144 freq happening - 24 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 - HPMNS hippomenes - 31 freq |
HIPPOMENES |
| Time to execute Levenshtein function - 0.183360 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.349302 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.027166 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.037641 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.000877 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. |