| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| oomph (0) - 4 freq oompa (1) - 1 freq mumph (2) - 1 freq sumph (2) - 21 freq comp (2) - 3 freq loompa (2) - 1 freq mph (2) - 2 freq oooh (2) - 8 freq gumph (2) - 1 freq ooh (2) - 37 freq pomp (2) - 2 freq bumph (2) - 3 freq oop (2) - 2 freq oops (2) - 18 freq hmmph (2) - 8 freq ooohh (2) - 1 freq morph (2) - 1 freq nymph (2) - 2 freq clomph (2) - 1 freq hmph (2) - 1 freq humph (2) - 15 freq compt (2) - 1 freq oohhh (2) - 2 freq ooooh (2) - 7 freq compy (2) - 1 freq |
oomph (0) - 4 freq mph (2) - 2 freq imph (2) - 1 freq oompa (2) - 1 freq sumph (3) - 21 freq bumph (3) - 3 freq nymph (3) - 2 freq morph (3) - 1 freq hmph (3) - 1 freq gumph (3) - 1 freq mmph (3) - 2 freq humph (3) - 15 freq mumph (3) - 1 freq jamph (3) - 1 freq zeph (4) - 1 freq moich (4) - 2 freq empy (4) - 6 freq moth (4) - 7 freq mooch (4) - 25 freq mpd (4) - 1 freq ymp (4) - 2 freq meh (4) - 192 freq mps (4) - 31 freq mouth (4) - 45 freq mh (4) - 3 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 - OMF oomph - 4 freq omagh - 2 freq |
OOMPH |
| Time to execute Levenshtein function - 0.524018 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.912273 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.083741 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.081405 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.000875 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. |